Scalable sparse covariance estimation via self-concordance

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

This paper develops a fast algorithm for computing the equilibrium assignment with the perturbed utility route choice (PURC) model. Without compromise, this allows the significant advantages of the PURC model to be used in large-scale applications. We form ...

Distributed learning is the key for enabling training of modern large-scale machine learning models, through parallelising the learning process. Collaborative learning is essential for learning from privacy-sensitive data that is distributed across various ...

Achieving robustness in engineering design is crucial for systems such as gas-bearing supported turbocompressors used in heat pumps and fuel cells, where precision affects efficiency and stability. Traditional design methods often optimize for nominal cond ...

Quantum support vector machines employ quantum circuits to define the kernel function. It has been shown that this approach offers a provable exponential speedup compared to any known classical algorithm for certain data sets. The training of such models c ...

We present a combination technique based on mixed differences of both spatial approximations and quadrature formulae for the stochastic variables to solve efficiently a class of optimal control problems (OCPs) constrained by random partial differential equ ...

Modern optimization is tasked with handling applications of increasingly large scale, chiefly due to the massive amounts of widely available data and the ever-growing reach of Machine Learning. Consequently, this area of research is under steady pressure t ...

Within the context of contemporary machine learning problems, efficiency of optimization process depends on the properties of the model and the nature of the data available, which poses a significant problem as the complexity of either increases ad infinit ...

We address black-box convex optimization problems, where the objective and constraint functions are not explicitly known but can be sampled within the feasible set. The challenge is thus to generate a sequence of feasible points converging towards an optim ...

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

In this paper, we present a spatial branch and bound algorithm to tackle the continuous pricing problem, where demand is captured by an advanced discrete choice model (DCM). Advanced DCMs, like mixed logit or latent class models, are capable of modeling de ...

We propose a method for sensor array self-localization using a set of sources at unknown locations. The sources produce signals whose times of arrival are registered at the sensors. We look at the general case where neither the emission times of the source ...

Recently there has been a surge of interest in understanding implicit regularization properties of iterative gradient-based optimization algorithms. In this paper, we study the statistical guarantees on the excess risk achieved by early-stopped unconstrain ...

This paper proposes a computational approach to form-find pin-jointed bar structures subjected to combinations of tension and compression forces. The generated equilibrium states can meet structural and geometrical constraints via gradient-based optimizati ...

This paper presents a novel distributed approach for solving AC power flow (PF) problems. The optimization problem is reformulated into a distributed form using a communication structure corresponding to a hypergraph, by which complex relationships between ...

This thesis is situated at the crossroads between machine learning and control engineering. Our contributions are both theoretical, through proposing a new uncertainty quantification methodology in a kernelized context; and experimental, through investigat ...

We develop a novel 2D functional learning framework that employs a sparsity-promoting regularization based on second-order derivatives. Motivated by the nature of the regularizer, we restrict the search space to the span of piecewise-linear box splines shi ...

In the field of cultural heritage, the use of non-destructive techniques to determine the state ofconservation of an artifact is of the utmost importance, to avoid damage to the object itself. In this paper, we present a data pipeline and several machine l ...

This work aims to study the effects of wind uncertainties in civil engineering structural design. Optimising the design of a structure for safety or operability without factoring in these uncertainties can result in a design that is not robust to these per ...

This work develops new algorithms with rigorous efficiency guarantees for infinite horizon imitation learning (IL) with linear function approximation without restrictive coherence assumptions. We begin with the minimax formulation of the problem and then o ...

In this paper, we analyze the recently proposed stochastic primal-dual hybrid gradient (SPDHG) algorithm and provide new theoretical results. In particular, we prove almost sure convergence of the iterates to a solution with convexity and linear convergenc ...

Scalable sparse covariance estimation via self-concordance

Chattez avec Graph Search

Perturbed Utility Stochastic Traffic Assignment

Optimization Algorithms for Decentralized, Distributed and Collaborative Machine Learning

Empowering turbocompressor design with AI: a unified approach to robustness and all-at-once optimization

The complexity of quantum support vector machines

A Combination Technique for Optimal Control Problems Constrained by Random PDEs

Scalable constrained optimization

Universal and adaptive methods for robust stochastic optimization

Safe Zeroth-Order Convex Optimization Using Quadratic Local Approximations

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

A Spatial Branch and Bound Algorithm for Continuous Pricing with Advanced Discrete Choice Demand Modeling

Localizing Unsynchronized Sensors With Unknown Sources

The statistical complexity of early-stopped mirror descent

Constrained Form-Finding of Tension-Compression Structures using Automatic Differentiation

Hypergraph-Based Fast Distributed AC Power Flow Optimization

Machine Learning Methods for Robust Uncertainty Quantification and Controller Approximation

Learning of Continuous and Piecewise-Linear Functions With Hessian Total-Variation Regularization

Data analysis techniques for the visualization and classification of historical vehicle engines' health status using data-driven solutions

Multi-Level Monte Carlo Methods for Uncertainty Quantification and Risk-Averse Optimisation

Proximal Point Imitation Learning

On The Convergence Of Stochastic Primal-Dual Hybrid Gradient