Lasso (statistics)

Formal sciences
Statistics
Data analysis
Cross-validation

About
Privacy
Disclaimer

Graph Chatbot

Related publications (31)

Predicting in Uncertain Environments: Methods for Robust Machine Learning

Paul Thierry Yves Rolland

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

EPFL2022

Daily Contributors of Tinnitus Loudness and Distress: An Ecological Momentary Assessment Study

Patrick Karl Alois Neff

BackgroundTinnitus is a heterogeneous condition which may be associated with moderate to severe disability, but the reasons why only a subset of individuals is burdened by the condition are not fully clear. Ecological momentary assessment (EMA) allows a be ...

FRONTIERS MEDIA SA2022

Learning of Continuous and Piecewise-Linear Functions With Hessian Total-Variation Regularization

Michaël Unser, Shayan Aziznejad, Joaquim Gonçalves Garcia Barreto Campos

We develop a novel 2D functional learning framework that employs a sparsity-promoting regularization based on second-order derivatives. Motivated by the nature of the regularizer, we restrict the search space to the span of piecewise-linear box splines shi ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Fast screening of covariates in population models empowered by machine learning

Jan Sickmann Hesthaven, Nadia Terranova

One of the objectives of Pharmacometry (PMX) population modeling is the identification of significant and clinically relevant relationships between parameters and covariates. Here, we demonstrate how this complex selection task could benefit from supervise ...

2021

Continual Learning for Natural Language Generation in Task-oriented Dialog Systems

Boi Faltings, Mengjie Zhao, Fei Mi, Liangwei Chen

Natural language generation (NLG) is an essential component of task-oriented dialog systems. Despite the recent success of neural approaches for NLG, they are typically developed in an offline manner for particular domains. To better fit real-life applicat ...

2021

Sparsest piecewise-linear regression of one-dimensional data

Michaël Unser, Julien René Pierre Fageot, Thomas Jean Debarre, Quentin Alain Denoyelle

We study the problem of one-dimensional regression of data points with total-variation (TV) regularization (in the sense of measures) on the second derivative, which is known to promote piecewise-linear solutions with few knots. While there are efficient a ...

Elsevier2021

Comparison of non-parametric T2 relaxometry methods for myelin water quantification

Jean-Philippe Thiran, Tobias Kober, Tom Hilbert, Erick Jorge Canales Rodriguez, Gian Franco Piredda, Marco Pizzolato, Thomas Yu, Alessandro Daducci, Nicolas Kunz

Multi-component T2 relaxometry allows probing tissue microstructure by assessing compartment-specific T2 relaxation times and water fractions, including the myelin water fraction. Non-negative least squares (NNLS) with zero-order Tikhonov regularization is ...

2021

Improving sample and feature selection with principal covariates regression

Michele Ceriotti, Edgar Albert Engel, Benjamin Aaron Helfrecht, Sergei Kliavinek

Selecting the most relevant features and samples out of a large set of candidates is a task that occurs very often in the context of automated data analysis, where it improves the computational performance and often the transferability of a model. Here we ...

2021

Compact atomic descriptors enable accurate predictions via linear models

Kevin Rossi

We probe the accuracy of linear ridge regression employing a three-body local density representation derived from the atomic cluster expansion. We benchmark the accuracy of this framework in the prediction of formation energies and atomic forces in molecul ...

AIP Publishing2021

A Newton Frank-Wolfe method for constrained self-concordant minimization

Volkan Cevher, Quoc Tran Dinh

We develop a new Newton Frank-Wolfe algorithm to solve a class of constrained self-concordant minimization problems using linear minimization oracles (LMO). Unlike L-smooth convex functions, where the Lipschitz continuity of the objective gradient holds gl ...

SPRINGER2022

Convex optimization in sums of Banach spaces

Michaël Unser, Shayan Aziznejad

We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a finite sum of compo ...

2021

Page 2 of 2