Stochastic Frank-Wolfe for Composite Convex Minimization

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.

Balancing economic and environmental goals in industrial applications is critical amid challenges like climate change. Multi-objective optimization (MOO) and multi-criteria decision analysis (MCDA) are key tools for addressing conflicting objectives. MOO g ...

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

We develop new tools to study landscapes in nonconvex optimization. Given one optimization problem, we pair it with another by smoothly parametrizing the domain. This is either for practical purposes (e.g., to use smooth optimization algorithms with good g ...

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

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

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

This paper proposes a methodology to optimize the dispatch and reserve between multiple units in a Hydroelectric Power Plant (HPP) that makes use of the Hydraulic Short Circuit (HSC) operating mode. HSC allows for the simultaneous generation and pumping fr ...

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

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

In this paper, we present a new parameterization and optimization procedure for minimizing the weight of ribbed plates. The primary goal is to reduce embodied CO2 in concrete floors as part of the effort to diminish the carbon footprint of the construction ...

A method for optimizing at least one of a geometry, an implantation procedure, and/or stimulation protocol of one or more electrodes for an electrical stimulation of a target structure in a nervous system of a living being by a computer device, the method ...

This code is used for developing the project entitled “Study on conformal antennas, proof of concept prototype for a UAV”, from the aspects of theory, design, and implementation. This code aims to speed up the investigation of an arbitrary phased array ant ...

Multiple tensor-times-matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimensional data analysis. We establish communication lower bounds that determine ...

Bayesian Optimization (BO) is typically used to optimize an unknown function f that is noisy and costly to evaluate, by exploiting an acquisition function that must be maximized at each optimization step. Even if provably asymptotically optimal BO algorith ...

While momentum-based accelerated variants of stochastic gradient descent (SGD) are widely used when training machine learning models, there is little theoretical understanding on the generalization error of such methods. In this work, we first show that th ...

In various robotics applications, the selection of function approximation methods greatly influences the feasibility and computational efficiency of algorithms. Tensor Networks (TNs), also referred to as tensor decomposition techniques, present a versatile ...

Cutting plane methods are a fundamental approach for solving integer linear programs (ILPs). In each iteration of such methods, additional linear constraints (cuts) are introduced to the constraint set with the aim of excluding the previous fractional opti ...

We study the problem of performance optimization of closed -loop control systems with unmodeled dynamics. Bayesian optimization (BO) has been demonstrated to be effective for improving closed -loop performance by automatically tuning controller gains or re ...

In this thesis, we study two closely related directions: robustness and generalization in modern deep learning. Deep learning models based on empirical risk minimization are known to be often non-robust to small, worst-case perturbations known as adversari ...

Stochastic Frank-Wolfe for Composite Convex Minimization

Chattez avec Graph Search

On the role of artificial intelligence in feature oriented multi-criteria decision analysis

Perturbed Utility Stochastic Traffic Assignment

Optimization Algorithms for Decentralized, Distributed and Collaborative Machine Learning

The effect of smooth parametrizations on nonconvex optimization landscapes

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

Scalable constrained optimization

The complexity of quantum support vector machines

Optimal Short-Term Dispatch of Pumped-Storage Hydropower Plants Including Hydraulic Short Circuit

A Combination Technique for Optimal Control Problems Constrained by Random PDEs

A ride time-oriented scheduling algorithm for dial-a-ride problems

Mesh-based topology, shape and sizing optimization of ribbed plates

A method and system for optimizing design, implantation, and stimulation protocols of electrodes stimulating the nervous system

Code for project entitled "study on conformal antennas, proof of concept prototype for a UAV"

COMMUNICATION LOWER BOUNDS AND OPTIMAL ALGORITHMS FOR MULTIPLE TENSOR-TIMES-MATRIX COMPUTATION

Relaxing the Additivity Constraints in Decentralized No-Regret High-Dimensional Bayesian Optimization

On the Generalization of Stochastic Gradient Descent with Momentum

Robot Learning using Tensor Networks

Learning to Remove Cuts in Integer Linear Programming

Violation-aware contextual Bayesian optimization for controller performance optimization with unmodeled constraints

Understanding generalization and robustness in modern deep learning