Efficient Algorithms for a Class of Stochastic Hidden Convex Optimization and Its Applications in Network Revenue Management

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.

Recent years have witnessed a growing integration of automatic control into a wide range of cyber-physical systems, including electrical grids and autonomous transportation networks. These systems operate in uncertain and dynamic environments, exhibit comp ...

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

Wasserstein balls, which contain all probability measures within a pre-specified Wasserstein distance to a reference measure, have recently enjoyed wide popularity in the distributionally robust optimization and machine learning communities to formulate an ...

Byzantine resilience emerged as a prominent topic within the distributed machine learning community. Essentially, the goal is to enhance distributed optimization algorithms, such as distributed SGD, in a way that guarantees convergence despite the presence ...

It was recently shown that almost all solutions in the symmetric binary perceptron are isolated, even at low constraint densities, suggesting that finding typical solutions is hard. In contrast, some algorithms have been shown empirically to succeed in fin ...

We address the problem of designing stabilizing control policies for nonlinear systems in discrete-time, while minimizing an arbitrary cost function. When the system is linear and the cost is convex, the System Level Synthesis (SLS) approach offers an effe ...

Discrete sizing and topology optimization of truss structures subject to stress and displacement constraints has been formulated as a Mixed-Integer Linear Programming (MILP) problem. The computation time to solve a MILP problem to global optimality via a b ...

Understanding the implicit bias of training algorithms is of crucial importance in order to explain the success of overparametrised neural networks. In this paper, we study the dynamics of stochastic gradient descent over diagonal linear networks through i ...

Training deep neural networks (DNNs) can be difficult due to the occurrence of vanishing/explod- ing gradients during weight optimization. To avoid this problem, we propose a class of DNNs stemming from the time discretization of Hamiltonian systems. The t ...

In the first part of this two-part paper we show that the branch-flow convexification of the OPF problem is not exact and that the ADMM-based decomposition of the OPF fails to converge in specific scenarios. Therefore, there is a need to develop algorithms ...

An optimization methodology based on Mixed Integer Linear Programming (MILP) has been developed for simultaneous optimization of water and energy (SOWE) in industrial processes. The superstructure integrates non-water process thermal streams and optimizes ...

In this paper, a novel optimality-tracking algorithm for solving Economic Nonlinear Model Predictive Control (ENMPC) problems in real-time is presented. Developing online schemes for ENMPC is challenging, since it is unclear how convexity of the Quadratic ...

Popularity of massive online open courses (MOOCs) allowed educational researchers to address problems which were not accessible few years ago. Although classical statistical techniques still apply, large datasets allow us to discover deeper patterns and to ...

A batch process is characterized by the repetition of time-varying operations of finite duration. Due to the repetition, there are two independent “time” variables, namely, the run time during a batch and the batch counter. Accordingly, the control and opt ...

This paper introduces a new methodology for pipeline synthesis with applications to data flow high-level system design. The pipeline synthesis is applied to dataflow programs whose operators are translated into graphs and dependencies relations that are th ...

Noisy 3D point clouds arise in many applications. They may be due to errors when creating a 3D model from images or simply to imprecise depth sensors. Point clouds can be given geometrical structure using graphs created from the similarity information betw ...

In this paper, we present an efficient numerical scheme for the recently introduced geodesic active fields (GAF) framework for geometric image registration. This framework considers the registration task as a weighted minimal surface problem. Hence, the da ...

Efficient Algorithms for a Class of Stochastic Hidden Convex Optimization and Its Applications in Network Revenue Management

Chattez avec Graph Search

Optimal Control under Uncertainty: From Regret Minimization to Distributional Robustness

Optimization Algorithms for Decentralized, Distributed and Collaborative Machine Learning

On Linear Optimization over Wasserstein Balls

Byzantine Machine Learning Made Easy By Resilient Averaging of Momentums

Binary Perceptron: Efficient Algorithms Can Find Solutions in a RareWell-Connected Cluster

Neural System Level Synthesis: Learning over All Stabilizing Policies for Nonlinear Systems

MILP-based discrete sizing and topology optimization of truss structures: new formulation and benchmarking

Implicit Bias of SGD for Diagonal Linear Networks: a Provable Benefit of Stochasticity

A unified framework for Hamiltonian deep neural networks

AC OPF in radial distribution networks – Part II: An augmented Lagrangian-based OPF algorithm, distributable via primal decomposition

A novel MILP approach for simultaneous optimization of water and energy: Application to a Canadian softwood Kraft pulping mill

A parametric augmented Lagrangian algorithm for real-time economic NMPC

A Tutorial on Machine Learning in Educational Science

Control and Optimization of Batch Processes

Synthesis and Optimization of Pipelines for HW Implementations of Dataflow Programs

Graph-based denoising for time-varying point clouds

Fast Geodesic Active Fields for Image Registration Based on Splitting and Augmented Lagrangian Approaches