Rigorous optimization recipes for sparse and low rank inverse problems with applications in data sciences

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.

Dynamical system (DS) based motion planning offers collision-free motion, with closed-loop reactivity thanks to their analytical expression. It ensures that obstacles are not penetrated by reshaping a nominal DS through matrix modulation, which is construc ...

Fuel performance codes are essential for predicting fuel rod behavior in nuclear reactors. These codes comprise a complex system of models with empirical constants that require calibration against experimental data. To support this calibration, this study ...

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

Integer linear programming (ILP) is an elegant approach to solve linear optimization problems, naturally described using integer decision variables. Within the context of physics-inspired machine learning (ML) applied to chemistry, we demonstrate the relev ...

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

The Birman-Williams theorem gives a connection between the collection of unstable periodic orbits (UPOs) contained within a chaotic attractor and the topology of that attractor, for three-dimensional systems. In certain cases, the fractal dimension of a ch ...

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

In this work, we develop first-order (Hessian-free) and zeroth-order (derivative-free) implementations of the Cubically Regularized Newton Method for solving general non-convex optimization problems. For that, we employ finite difference approximations of ...

In this paper, we propose an analytical stochastic dynamic programming (SDP) algorithm to address the optimal management problem of price-maker community energy storage. As a price-maker, energy storage smooths price differences, thus decreasing energy arb ...

Decision-making permeates every aspect of human and societal development, from individuals' daily choices to the complex decisions made by communities and institutions. Central to effective decision-making is the discipline of optimization, which seeks th ...

A shortcut model is a low-order model that provides a simplified representation of a complex process, thereby enabling faster and more efficient analysis, design and optimization without the computational intensity of a full-scale model. For continuous dis ...

Modern integrated circuits are tiny yet incredibly complex technological artifacts, composed of millions and billions of individual structures working in unison. Managing their complexity and facilitating their design drove part of the co-evolution of mode ...

Context. Imaging in radio interferometry requires solving an ill-posed noisy inverse problem, for which the most adopted algorithm is the original CLEAN algorithm and its variants. Alternative explicit optimization methods have gained increasing attention, ...

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

Many challenges of modern graph processing stem from the fact that graphs have become massive and change frequently. Numerous techniques have been developed to address those issues, with graph cut sparsification offering to replace original graphs with th ...

Slope deformation poses significant risks to infrastructure, ecosystems, and human safety, making early and accurate predictions essential for mitigating slope failures and landslides. In this study, we propose a novel approach that integrates a fractional ...

Given a sequence of functions

f_1,\ldots,f_n

with

f_i:\mathcal{D}\mapsto \mathbb{R}

, finite-sum minimization seeks a point

{x}^\star \in \mathcal{D}

minimizing

\sum_{j=1}^nf_j(x)/n

. In this work, we propose a key twist into the finite-sum minimizat ...

Cluster expansions are commonly employed as surrogate models to link the electronic structure of an alloy to its finite-temperature properties. Using cluster expansions to model materials with several alloying elements is challenging due to a rapid increas ...

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

Faithful human performance capture and free-view rendering from sparse RGB observations is a long-standing problem in Vision and Graphics. The main challenges are the lack of observations and the inherent ambiguities of the setting, e.g. occlusions and dep ...

Rigorous optimization recipes for sparse and low rank inverse problems with applications in data sciences

Chat with Graph Search

Reactive collision-free motion generation in joint space via dynamical systems and sampling-based MPC

Preliminary Sensitivity Analysis of Time-Dependent Code Outputs in Fuel Performance Models Using OFFBEAT for Future Calibration

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Integer Linear Programming for Unsupervised Training Set Selection in Molecular Machine Learning

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

The topology of a chaotic attractor in the Kuramoto-Sivashinsky equation

Optimization Algorithms for Decentralized, Distributed and Collaborative Machine Learning

First and Zeroth-Order Implementations of the Regularized Newton Method with Lazy Approximated Hessians

Energy Management of Price-Maker Community Energy Storage by Stochastic Dynamic Programming

Reliable data-driven decision-making through optimal transport

A shortcut model for batch distillation columns using pertinent effective factors

Graph generative deep learning models with an application to circuit topologies

PolyCLEAN: Atomic optimization for super-resolution imaging and uncertainty estimation in radio interferometry

The effect of smooth parametrizations on nonconvex optimization landscapes

Graph sparsification, sketching and adaptivity

Slope Deformation Prediction Combining Particle Swarm Optimization-Based Fractional-Order Grey Model and K-Means Clustering

Efficient Continual Finite-Sum Minimization

Constructing multicomponent cluster expansions with machine-learning and chemical embedding

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

MetaCap: Meta-learning Priors from Multi-view Imagery for Sparse-View Human Performance Capture and Rendering