Copertina

Coordinate Descent for SLOPE

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Larsson, Johan, Klopfenstein, Quentin, Massias, Mathurin, Wallin, Jonas
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Optimization and Control Computation Machine Learning 62-08 G.1.6; G.4; G.3
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

The Strong Screening Rule for SLOPE
di: Larsson, Johan, et al.
Pubblicazione: (2020)

Efficient Solvers for SLOPE in R, Python, Julia, and C++
di: Larsson, Johan, et al.
Pubblicazione: (2025)

The Hessian Screening Rule
di: Larsson, Johan, et al.
Pubblicazione: (2021)

The Choice of Normalization Influences Shrinkage in Regularized Regression
di: Larsson, Johan, et al.
Pubblicazione: (2025)

Multiple Approximate-Response Agents (MARA): Fast Near-Optimal Primal Recovery for Distributed Optimization
di: Parshakova, Tetiana, et al.
Pubblicazione: (2025)

A near-exact linear mixed model for genome-wide association studies
di: Pu, Zhibin, et al.
Pubblicazione: (2025)

On Barycenter Computation: Semi-Unbalanced Optimal Transport-based Method on Gaussians
di: Nguyen, Ngoc-Hai, et al.
Pubblicazione: (2024)

Look-Ahead Screening Rules for the Lasso
di: Larsson, Johan
Pubblicazione: (2021)

Optimal control of partial differential equations in PyTorch using automatic differentiation and neural network surrogates
di: Khimin, Denis, et al.
Pubblicazione: (2024)

Convergence Analysis of Fractional Gradient Descent
di: Aggarwal, Ashwani
Pubblicazione: (2023)

Learning What Evaluators Value: A Reliable Approach to Modeling Evaluator Preferences
di: Kitch, Madeline Celi, et al.
Pubblicazione: (2026)

Support-Conditioned Flow Matching Is Kernel Smoothing
di: Smola, Daniel Matsui
Pubblicazione: (2026)

Empirical evaluation of normalizing flows in Markov Chain Monte Carlo
di: Nabergoj, David, et al.
Pubblicazione: (2024)

Identifying Multi-Hit Cancer Drivers Without Massive Parallelization: A CP, MIP, and Column Generation Framework
di: Willemsen, Rick S. H., et al.
Pubblicazione: (2026)

Multi-fidelity constraints in blackbox optimization
di: Alarie, Stéphane, et al.
Pubblicazione: (2026)

Rethinking Physics-Informed Regression Beyond Training Loops and Bespoke Architectures
di: Sabug Jr., Lorenzo, et al.
Pubblicazione: (2025)

ALMAB-DC: Active Learning, Multi-Armed Bandits, and Distributed Computing for Sequential Experimental Design and Black-Box Optimization
di: Hui-Mean, Foo, et al.
Pubblicazione: (2026)

Rapid Grassmannian Averaging with Chebyshev Polynomials
di: Ancelin, Brighton, et al.
Pubblicazione: (2024)

SHIFT: Robust Double Machine Learning for Average Dose-Response Functions under Heavy-Tailed Contamination
di: Uehara, Eichi
Pubblicazione: (2026)

Towards safe and tractable Gaussian process-based MPC: Efficient sampling within a sequential quadratic programming framework
di: Prajapat, Manish, et al.
Pubblicazione: (2024)

Fast and Exact Least Absolute Deviations Line Fitting via Piecewise Affine Lower-Bounding
di: Volz, Stefan, et al.
Pubblicazione: (2025)

An Iterative Algorithm for Regularized Non-negative Matrix Factorizations
di: Pav, Steven E.
Pubblicazione: (2024)

Proof-Carrying No-Arbitrage Surfaces: Constructive PCA-Smolyak Meets Chain-Consistent Diffusion with c-EMOT Certificates
di: Zhang, Jian'an
Pubblicazione: (2025)

Trust Region Algorithm for Stochastic Minimax Problems with Decision-Dependent Distributions
di: Gao, Yan, et al.
Pubblicazione: (2025)

Learning Latent Graph Geometry via Fixed-Point Schrödinger-Type Activation: A Theoretical Study
di: Pasechnyuk-Vilensky, Dmitry, et al.
Pubblicazione: (2025)

A Restless Bandit Model for Dynamic Ride Matching with Reneging Travelers
di: Fu, Jing, et al.
Pubblicazione: (2021)

Natural gradient descent with momentum
di: Nouy, Anthony, et al.
Pubblicazione: (2026)

Regular Tree Search for Simulation Optimization
di: Wang, Du-Yi, et al.
Pubblicazione: (2025)

Fisher Scoring for Exact Matérn Covariance Estimation through Stable Smoothness Optimization
di: Hong, Yiping, et al.
Pubblicazione: (2026)

Provable Adversarial Robustness in In-Context Learning
di: Zhang, Di
Pubblicazione: (2026)

GeMA: Learning Latent Manifold Frontiers for Benchmarking Complex Systems
di: Li, Jia Ming, et al.
Pubblicazione: (2026)

A Review of Bilevel Optimization: Methods, Emerging Applications, and Recent Advancements
di: Pujara, Dhaval, et al.
Pubblicazione: (2025)

Formalization of Optimality Conditions for Smooth Constrained Optimization Problems
di: Li, Chenyi, et al.
Pubblicazione: (2025)

A Relaxation Method for Nonsmooth Nonlinear Optimization with Binary Constraints
di: Xiao, Lianghai, et al.
Pubblicazione: (2026)

Formalization of Algorithms for Optimization with Block Structures
di: Li, Chenyi, et al.
Pubblicazione: (2025)

Universal Neural Optimal Transport
di: Geuter, Jonathan, et al.
Pubblicazione: (2022)

Higher order measures of risk and stochastic dominance
di: Pichler, Alois
Pubblicazione: (2024)

A Self-Adaptive Penalty Method for Integrating Prior Knowledge Constraints into Neural ODEs
di: Coelho, C., et al.
Pubblicazione: (2023)

SuperADMM: Solving Quadratic Programs Faster with Dynamic Weighting ADMM
di: Verheijen, P. C. N., et al.
Pubblicazione: (2025)

Retrospective Counterfactual Prediction by Conditioning on the Factual Outcome: A Cross-World Approach
di: Bodik, Juraj
Pubblicazione: (2026)