Cover Image

Are Greedy Task Orderings Better Than Random in Continual Linear Regression?

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Tsipory, Matan, Levinstein, Ran, Evron, Itay, Kong, Mark, Needell, Deanna, Soudry, Daniel
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

From Continual Learning to SGD and Back: Better Rates for Continual Linear Models
by: Evron, Itay, et al.
Published: (2025)

Optimal Rates in Continual Linear Regression via Increasing Regularization
by: Levinstein, Ran, et al.
Published: (2025)

Optimal L2 Regularization in High-dimensional Continual Linear Regression
by: Karpel, Gilad, et al.
Published: (2026)

The Joint Effect of Task Similarity and Overparameterization on Catastrophic Forgetting -- An Analytical Model
by: Goldfarb, Daniel, et al.
Published: (2024)

Linear Discriminant Analysis with the Randomized Kaczmarz Method
by: Chi, Jocelyn T., et al.
Published: (2022)

Provable Tempered Overfitting of Minimal Nets and Typical Nets
by: Harel, Itamar, et al.
Published: (2024)

PLUMAGE: Probabilistic Low rank Unbiased Min Variance Gradient Estimator for Efficient Large Model Training
by: Haroush, Matan, et al.
Published: (2025)

Foldable SuperNets: Scalable Merging of Transformers with Different Initializations and Tasks
by: Kinderman, Edan, et al.
Published: (2024)

Cauchy Random Features for Operator Learning in Sobolev Space
by: Liao, Chunyang, et al.
Published: (2025)

Manifold Learning with Normalizing Flows: Towards Regularity, Expressivity and Iso-Riemannian Geometry
by: Diepeveen, Willem, et al.
Published: (2025)

Differentially Private Random Feature Model
by: Liao, Chunyang, et al.
Published: (2024)

Towards Cheaper Inference in Deep Networks with Lower Bit-Width Accumulators
by: Blumenfeld, Yaniv, et al.
Published: (2024)

Riemannian Archetypal Analysis: Interpretable non-linear data analysis on deformed star distributions
by: Diepeveen, Willem, et al.
Published: (2026)

Observational Multiplicity
by: George, Erin, et al.
Published: (2025)

Fine-grained Analysis and Faster Algorithms for Iteratively Solving Linear Systems
by: Dereziński, Michał, et al.
Published: (2024)

Randomized Kaczmarz in Adversarial Distributed Setting
by: Huang, Longxiu, et al.
Published: (2023)

Randomized Kaczmarz Methods with Beyond-Krylov Convergence
by: Dereziński, Michał, et al.
Published: (2025)

Minimum Variance Unbiased N:M Sparsity for the Neural Gradients
by: Chmiel, Brian, et al.
Published: (2022)

Kernel Alignment for Unsupervised Feature Selection via Matrix Factorization
by: Lin, Ziyuan, et al.
Published: (2024)

Block Sparse Flash Attention
by: Ohayon, Daniel, et al.
Published: (2025)

Tensor-Parallelism with Partially Synchronized Activations
by: Lamprecht, Itay, et al.
Published: (2025)

Harmful Overfitting in Sobolev Spaces
by: Karhadkar, Kedar, et al.
Published: (2026)

Quantile-Based Randomized Kaczmarz for Corrupted Tensor Linear Systems
by: Castillo, Alejandra, et al.
Published: (2025)

Curvature Corrected Nonnegative Manifold Data Factorization
by: Chew, Joyce, et al.
Published: (2025)

Stochastic gradient descent for streaming linear and rectified linear systems with adversarial corruptions
by: Jeong, Halyun, et al.
Published: (2024)

Learn to Evolve: Self-supervised Neural JKO Operator for Wasserstein Gradient Flow
by: Feng, Xue, et al.
Published: (2026)

Convergence and Complexity Guarantee for Inexact First-order Riemannian Optimization Algorithms
by: Li, Yuchen, et al.
Published: (2024)

Convergence and complexity of block majorization-minimization for constrained block-Riemannian optimization
by: Li, Yuchen, et al.
Published: (2023)

Random Vector Functional Link Networks for Function Approximation on Manifolds
by: Needell, Deanna, et al.
Published: (2020)

Benign overfitting in leaky ReLU networks with moderate input dimension
by: Karhadkar, Kedar, et al.
Published: (2024)

Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Sampling
by: Cai, HanQin, et al.
Published: (2022)

Still No Lie Detector for Language Models: Probing Empirical and Conceptual Roadblocks
by: Levinstein, B. A., et al.
Published: (2023)

Revisiting Randomization in Greedy Model Search
by: Chen, Xin, et al.
Published: (2025)

A Graph Meta-Network for Learning on Kolmogorov-Arnold Networks
by: Bar-Shalom, Guy, et al.
Published: (2026)

Towards a Fairer Non-negative Matrix Factorization
by: Kassab, Lara, et al.
Published: (2024)

Block Matrix and Tensor Randomized Kaczmarz Methods for Linear Feasibility Problems
by: Zhang, Minxin, et al.
Published: (2024)

To Grok Grokking: Provable Grokking in Ridge Regression
by: Xu, Mingyue, et al.
Published: (2026)

Understanding Forgetting in Continual Learning with Linear Regression
by: Ding, Meng, et al.
Published: (2024)

Complexity of Vector-valued Prediction: From Linear Models to Stochastic Convex Optimization
by: Schliserman, Matan, et al.
Published: (2024)

How Uniform Random Weights Induce Non-uniform Bias: Typical Interpolating Neural Networks Generalize with Narrow Teachers
by: Buzaglo, Gon, et al.
Published: (2024)