Given a data matrix and a response vector , suppose , it costs time and space to solve the least squares regression (LSR) problem. When and are both large, exactly solving the LSR problem is very expensive. When , one feasible approach to spee…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
11 results for “LSR”
Study analyzes label smoothing in deep learning optimization.
problem Understanding label smoothing's impact on deep learning optimization.
method Analysis of stochastic gradient descent with label smoothing for non-convex problems.
result Label smoothing can speed up convergence by reducing variance.
New tensor model reduces GLM estimation error and sample complexity.
problem Estimating GLM coefficients with reduced sample complexity.
method Developed LSR tensor model and block coordinate descent algorithm.
result Minimax lower bound on estimation error, suggesting lower sample complexity.
Proposes LsrKD and MrKD to improve neural network training performance.
problem Improving neural network training performance, especially on deep networks.
method Extends Label Smoothing Regularization with Self-Knowledge Distillation, introducing LsrKD and MrKD.
result LsrKD and MrKD significantly improve training performance on deep neural networks.
Proposes LSR-IGRU for improved stock trend prediction.
problem Challenges in stock price prediction due to complex relationships and nonlinear dynamics.
method Long short-term relationships matrix and improved GRU input for better temporal and relationship integration.
result Significantly improved accuracy in predicting stock trend changes.
Improved tensor GLM estimation for complex data.
problem Complex tensor data in GLMs leads to high-dimensional, ill-posed estimation.
method Proposed LSRTR-M algorithm using Muon updates for faster convergence and lower errors.
result LSRTR-M converges faster and achieves lower errors than LSRTR.
Sketched Ridge Regression: Optimization Perspective, Statistical Perspective, and Model Averagingstat.ML
We address the statistical and optimization impacts of the classical sketch and Hessian sketch used to approximately solve the Matrix Ridge Regression (MRR) problem. Prior research has quantified the effects of classical sketch on the strictly simpler least squares regression (LSR) problem. We establish that classical …
Paper analyzes convergence rates of compressed LSR algorithms in federated learning.
problem Impact of compression on convergence rates in distributed learning.
method Analyzes a general stochastic approximation algorithm for LSR with weak assumptions.
result Convergence rates depend on the covariance of additive noise and compression strategy.
A new method reduces variance in training early-stage rankers for large-scale search systems.
problem Training early-stage rankers for large-scale search systems is challenging due to exploding variance in policy gradient methods.
method Proposes credit-assigned policy gradient (CA-PG) to mitigate variance in training early-stage rankers.
result CA-PG significantly reduces variance in training early-stage rankers compared to vanilla policy gradient.
Geographic object-based image analysis (GEOBIA) framework has gained increasing interest recently. Following this popular paradigm, we propose a novel multiscale classification approach operating on a hierarchical image representation built from two images at different resolutions. They capture the same scene with diff…
MicroRNAs (miRNAs) are small RNA molecules composed of 19-22 nt, which play important regulatory roles in post-transcriptional gene regulation by inhibiting the translation of the mRNA into proteins or otherwise cleaving the target mRNA. Inferring miRNA targets provides useful information for understanding the roles of…