Cover Image

Near-optimal and Efficient First-Order Algorithm for Multi-Task Learning with Shared Linear Representation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ding, Shihong, Du, Fangyu, Fang, Cong
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Accelerating Single-Pass SGD for Generalized Linear Prediction
by: Chen, Qian, et al.
Published: (2026)

A Single-Loop First-Order Algorithm for Linearly Constrained Bilevel Optimization
by: Shen, Wei, et al.
Published: (2025)

On the Linear Speedup of Personalized Federated Reinforcement Learning with Shared Representations
by: Xiong, Guojun, et al.
Published: (2024)

A New First-Order Meta-Learning Algorithm with Convergence Guarantees
by: Chayti, El Mahdi, et al.
Published: (2024)

Efficient First-Order Optimization on the Pareto Set for Multi-Objective Learning under Preference Guidance
by: Chen, Lisha, et al.
Published: (2025)

First-Order Methods for Linearly Constrained Bilevel Optimization
by: Kornowski, Guy, et al.
Published: (2024)

Near-Optimal Primal-Dual Algorithm for Learning Linear Mixture CMDPs with Adversarial Rewards
by: Yu, Kihyun, et al.
Published: (2026)

Fully First-Order Algorithms for Online Bilevel Optimization
by: Jia, Tingkai, et al.
Published: (2026)

PAPAL: A Provable PArticle-based Primal-Dual ALgorithm for Mixed Nash Equilibrium
by: Ding, Shihong, et al.
Published: (2023)

Near-Optimal Tensor PCA via Normalized Stochastic Gradient Ascent with Overparameterization
by: Ding, Shihong, et al.
Published: (2025)

Optimal and Order-optimal Gated Priority-based Greedy Policies for Two-layer Multi-item Order Fulfillment
by: Chen, Xi, et al.
Published: (2026)

Convergence and Sample Complexity of First-Order Methods for Agnostic Reinforcement Learning
by: Sherman, Uri, et al.
Published: (2025)

The Implicit Bias of Heterogeneity towards Invariance: A Study of Multi-Environment Matrix Sensing
by: Xu, Yang, et al.
Published: (2024)

Nearly Optimal Linear Convergence of Stochastic Primal-Dual Methods for Linear Programming
by: Lu, Haihao, et al.
Published: (2021)

Multi-task Representation Learning for Mixed Integer Linear Programming
by: Cai, Junyang, et al.
Published: (2024)

A Nearly Optimal and Low-Switching Algorithm for Reinforcement Learning with General Function Approximation
by: Zhao, Heyang, et al.
Published: (2023)

Minimax Excess Risk of First-Order Methods for Statistical Learning with Data-Dependent Oracles
by: Scaman, Kevin, et al.
Published: (2023)

Biased Stochastic First-Order Methods for Conditional Stochastic Optimization and Applications in Meta Learning
by: Hu, Yifan, et al.
Published: (2020)

StablePCA: Distributionally Robust Learning of Shared Representations from Multi-Source Data
by: Wang, Zhenyu, et al.
Published: (2025)

Bridging Constraints and Stochasticity: A Fully First-Order Method for Stochastic Bilevel Optimization with Linear Constraints
by: Phan, Cac, et al.
Published: (2025)

Data-Efficient and Robust Task Selection for Meta-Learning
by: Zhan, Donglin, et al.
Published: (2024)

Near-Optimal Distributed Minimax Optimization under the Second-Order Similarity
by: Zhou, Qihao, et al.
Published: (2024)

Efficient Optimization Algorithms for Linear Adversarial Training
by: RIbeiro, Antônio H., et al.
Published: (2024)

On the Complexity of First-Order Methods in Stochastic Bilevel Optimization
by: Kwon, Jeongyeol, et al.
Published: (2024)

A Study of Condition Numbers for First-Order Optimization
by: Guille-Escuret, Charles, et al.
Published: (2020)

Cost-Driven Representation Learning for Linear Quadratic Gaussian Control: Part II
by: Tian, Yi, et al.
Published: (2026)

Cost-Driven Representation Learning for Linear Quadratic Gaussian Control: Part I
by: Tian, Yi, et al.
Published: (2022)

Communication Efficient Federated Learning with Linear Convergence on Heterogeneous Data
by: Liu, Jie, et al.
Published: (2025)

Online Optimization Perspective on First-Order and Zero-Order Decentralized Nonsmooth Nonconvex Stochastic Optimization
by: Sahinoglu, Emre, et al.
Published: (2024)

Near-Optimal Algorithms for Group Distributionally Robust Optimization and Beyond
by: Soma, Tasuku, et al.
Published: (2022)

Fast Algorithm for Constrained Linear Inverse Problems
by: Sheriff, Mohammed Rayyan, et al.
Published: (2022)

Batched First-Order Methods for Parallel LP Solving in MIP
by: Blin, Nicolas, et al.
Published: (2026)

Accelerated Fully First-Order Methods for Bilevel and Minimax Optimization
by: Li, Chris Junchi
Published: (2024)

A Parameter-Free First-Order Algorithm for Non-Convex Optimization with $\tilde{\mkern1mu O}(ε^{-5/3})$ Global Rate
by: Xiong, Sichao, et al.
Published: (2026)

Task-optimal data-driven surrogate models for eNMPC via differentiable simulation and optimization
by: Mayfrank, Daniel, et al.
Published: (2024)

FedGiA: An Efficient Hybrid Algorithm for Federated Learning
by: Zhou, Shenglong, et al.
Published: (2022)

NeuralQP: A General Hypergraph-based Optimization Framework for Large-scale QCQPs
by: Xiong, Zhixiao, et al.
Published: (2024)

Coreset-Based Task Selection for Sample-Efficient Meta-Reinforcement Learning
by: Zhan, Donglin, et al.
Published: (2025)

Policy Gradient Converges to the Globally Optimal Policy for Nearly Linear-Quadratic Regulators
by: Han, Yinbin, et al.
Published: (2023)

Differentially Private Bilevel Optimization: Efficient Algorithms with Near-Optimal Rates
by: Lowy, Andrew, et al.
Published: (2025)