arXiv Machine Learning By Zitian Zhou, Nan Lin

Adaptive Iterative Hard Thresholding for Online High-dimensional Quantile Regression

Read the original on arXiv Machine Learning →

arXiv:2606. 28652v1 Announce Type: cross Abstract: Online high-dimensional regression requires algorithms that can update sequentially while preserving structural sparsity.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

Hugging Face Trending Papers
Jun 21

Distribution-Aware Robust Bilevel Optimization: Quantile-Guided Huber Updates in Two-Timescale Stochastic Approximation

Bilevel optimization (BLO) is fundamental to hierarchical decision-making but suffers from critical instability under heavy-tailed stochastic noise. Existing variance-reduction techniques typically rely on myopic magnitude checks, which fail to distinguish informative geometric signals from impulsive outliers.