A Fast Gradient Method for Nonnegative Sparse Regression With Self-Dictionary

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.

The Box and Block test (BBT) is a clinical test for the evaluation of the unilateral manual dexterity. To the best of our knowledge, no study has yet explored it through the muscle synergy approach. Since each analysis step impacts on the muscle synergies ...

High-dimensional data must be highly structured to be learnable. Although the compositional and hierarchical nature of data is often put forward to explain learnability, quantitative measurements establishing these properties are scarce. Likewise, accessin ...

Increasing the scanning speed in Atomic Force Microscopy (AFM) relies on improving the tracking performance in the vertical direction of motion. The lightly damped resonances of piezo-actuators utilized in AFM nano-positioning stages hinder the maximum ach ...

Deep neural networks (DNNs) are receiving increasing attention in wind power forecasting due to their ability to effectively capture complex patterns in wind data. However, their forecast errors are severely limited by the local optimal weight issue in opt ...

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

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 investigate popular resampling methods for estimating the uncertainty of statistical models, such as subsampling, bootstrap and the jackknife, and their performance in high-dimensional supervised regression tasks. We provide a tight asymptotic descripti ...

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

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

In this PhD manuscript, we explore optimisation phenomena which occur in complex neural networks through the lens of

2

-layer diagonal linear networks. This rudimentary architecture, which consists of a two layer feedforward linear network with a diagonal ...

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

This paper studies the problem of online performance optimization of constrained closed-loop control systems, where both the objective and the constraints are unknown black-box functions affected by exogenous time-varying contextual disturbances. A primal- ...

Established techniques that enable robots to learn from demonstrations are based on learning a stable dynamical system (DS). To increase the robots' resilience to perturbations during tasks that involve static obstacle avoidance, we propose incorporating b ...

Designing turbocompressors is a complex and challenging task, as it involves balancing conflicting objectives such as efficiency, stability, and robustness against manufacturing deviations. This paper proposes an integrated design methodology for turbocomp ...

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

A key challenge across many disciplines is to extract meaningful information from data which is often obscured by noise. These datasets are typically represented as large matrices. Given the current trend of ever-increasing data volumes, with datasets grow ...

The finite element method is a well-established method for the numerical solution of partial differential equations (PDEs), both linear and nonlinear. However, the repeated re -assemblage of finite element matrices for nonlinear PDEs is frequently pointed ...

Nonlinear model predictive control (NMPC) has been widely adopted to manipulate bilinear systems with dynamics that include products of the inputs and the states. These systems are ubiquitous in chemical processes, mechanical systems, and quantum physics, ...

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

A Fast Gradient Method for Nonnegative Sparse Regression With Self-Dictionary

Chat with Graph Search

Effective muscle synergies extraction pipeline to characterise the Box and Block Test movement

Probing the latent hierarchical structure of data via diffusion models

Data-driven control in atomic force microscopy using a genetic algorithm

Improving the accuracy and interpretability of neural networks for wind power forecasting

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Universal and adaptive methods for robust stochastic optimization

Analysis of Bootstrap and Subsampling in High-dimensional Regularized Regression

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

Safe Zeroth-Order Convex Optimization Using Quadratic Local Approximations

Scalable constrained optimization

Deep Learning Theory Through the Lens of Diagonal Linear Networks

Quality-Constrained Encoding Optimization for Omnidirectional Video Streaming

Primal-Dual Contextual Bayesian Optimization for Control System Online Optimization with Time-Average Constraints

Learning Barrier-Certified Polynomial Dynamical Systems for Obstacle Avoidance with Robots

An Integrated Approach to Designing Robust Turbocompressors on Gas Bearings Through Surrogate Modeling and Constrained Multi-Objective Optimization

Learning to Remove Cuts in Integer Linear Programming

Spectral Estimators for High-Dimensional Matrix Inference

On the fast assemblage of finite element matrices with application to nonlinear heat transfer problems

A Proximal-Point Lagrangian-Based Parallelizable Nonconvex Solver for Bilinear Model Predictive Control

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