Combinatorial Penalties: Which structures are preserved by convex relaxations?

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Motivated by the omnipresence of hierarchical structures in many real-world applications, this study delves into the intricate realm of bi-level games, with a specific focus on exploring local Stackelberg equilibria as a solution concept. While existing li ...

In order to extract maximum surplus from a heterogeneous customer base it is common practice for firms to offer a portfolio of differentiated products, from which consumers of different preferences can select their favorite items. The standard model of pro ...

The ever-increasing impact of deploying renewable energy resources reducing power system inertia, requires distributed energy resource (DER) aggregators to secure high-performance, fast-responding primary frequency reserve (PFR) in ancillary service market ...

Recent trends in market liberalization and increasing congestion in the European interconnected grid have motivated study of market parameters provided close to real-time. In this paper, we present a method to compute the available transfer capacities betw ...

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 ...

Orthogonal group synchronization is the problem of estimating n elements Z(1),& mldr;,Z(n) from the rxr orthogonal group given some relative measurements R-ij approximate to Z(i)Z(j)(-1). The least-squares formulation is nonconvex. To avoid its local minim ...

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 ...

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 ...

Semi-discrete optimal transport problems, which evaluate the Wasserstein distance between a discrete and a generic (possibly non-discrete) probability measure, are believed to be computationally hard. Even though such problems are ubiquitous in statistics, ...

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 ...

Omnidirectional video streaming is usually implemented based on the representations of tiles, where the tiles are obtained by splitting the video frame into several rectangular areas and each tile is converted into multiple representations with different r ...

In this thesis we design online combinatorial optimization algorithms for beyond worst-case analysis settings. In the first part, we discuss the online matching problem and prove that, in the edge arrival model, no online algorithm can achieve a competiti ...

Control systems operating in real-world environments often face disturbances arising from measurement noise and model mismatch. These factors can significantly impact the perfor- mance and safety of the system. In this thesis, we aim to leverage data to de ...

One of the main goal of Artificial Intelligence is to develop models capable of providing valuable predictions in real-world environments. In particular, Machine Learning (ML) seeks to design such models by learning from examples coming from this same envi ...

A new approach is presented to obtain a convex set of robust D—stabilizing fixed structure controllers, relying on Cauchy's argument principle. A convex set of D—stabilizing controllers around an initial D—stabilizing controller for a multi-model set is re ...

We propose Kernel Predictive Control (KPC), a learning-based predictive control strategy that enjoys deterministic guarantees of safety. Noise-corrupted samples of the unknown system dynamics are used to learn several models through the formalism of non-pa ...

Strategic information is valuable either by remaining private (for instance if it is sensitive) or, on the other hand, by being used publicly to increase some utility. These two objectives are antagonistic and leaking this information by taking full advant ...

The projection of sample measurements onto a reconstruction space represented by a basis on a regular grid is a powerful and simple approach to estimate a probability density function. In this paper, we focus on Riesz bases and propose a projection operato ...

Combinatorial Penalties: Which structures are preserved by convex relaxations?

Chat with Graph Search

On decentralized computation of the leader's strategy in bi-level games

Robust Optimization for Product Line Design

Stochastic Risk-driven Bidding of a Solar and Storage Aggregator in Primary Frequency and Energy Markets: A Performance-based Capacity Allocation Approach

Inner Approximation of Polytopes for Near-Real Time Available Transfer Capacity Optimization

The complexity of quantum support vector machines

BENIGN LANDSCAPES OF LOW-DIMENSIONAL RELAXATIONS FOR ORTHOGONAL SYNCHRONIZATION ON GENERAL GRAPHS

Optimization Algorithms for Decentralized, Distributed and Collaborative Machine Learning

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

Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution

Universal and adaptive methods for robust stochastic optimization

Quality-Constrained Encoding Optimization for Omnidirectional Video Streaming

Beyond worst-case analysis, with or without predictions

Data-Driven Control and Optimization under Noisy and Uncertain Conditions

Predicting in Uncertain Environments: Methods for Robust Machine Learning

A convex set of robust D—stabilizing controllers using Cauchy's argument principle

KPC: Learning-Based Model Predictive Control with Deterministic Guarantees

Utility/privacy trade-off as regularized optimal transport

Bona Fide Riesz Projections For Density Estimation