paper-with-me

홈 › Papers

Minimax optimal transfer learning for high-dimensional additive regression

2025-09-08 · Seung Hyun Moon arxiv

This paper studies high-dimensional additive regression under the transfer learning framework, where one observes samples from a target population together with auxiliary samples from different but potentially related regression models. We first introduce a target-only estimation procedure based on the smooth backfitting estimator with local linear smoothing. In contrast to previous work, we establish general error bounds under sub-Weibull($α$) noise, thereby accommodating heavy-tailed error distributions. In the sub-exponential case ($α=1$), we show that the estimator attains the minimax lower bound under regularity conditions, which requires a substantial departure from existing proof strategies. We then develop a novel two-stage estimation method within a transfer learning framework, and provide theoretical guarantees at both the population and empirical levels. Error bounds are derived for each stage under general tail conditions, and we further demonstrate that the minimax optimal rate is achieved when the auxiliary and target distributions are sufficiently close. All theoretical results are supported by simulation studies and real data analysis.

📄 PDF Abstract BibTeX arXiv:2509.06308

Code (0)

등록된 구현이 없습니다.

Tasks

Transfer Learning

Similar Papers 제목 키워드 기반

Minimax Optimal Rates of Estimation in High Dimensional Additive Models: Universal Phase Transition

2015-03-10 · Ming Yuan, Ding-Xuan Zhou

We establish minimax optimal rates of convergence for estimation in a high dimensional additive model assuming that it is approximately sparse. Our results reveal an interesting phase transition behavior universal to thi…

Additive modelsregression

Lower bounds on minimax rates for nonparametric regression with additive sparsity and smoothness

2009-12-01 · NeurIPS 2009 12 · Garvesh Raskutti, Bin Yu, Martin J. Wainwright

This paper uses information-theoretic techniques to determine minimax rates for estimating nonparametric sparse additive regression models under high-dimensional scaling. We assume an additive decomposition of the form …

regression

PAC-Bayesian High Dimensional Bipartite Ranking

2015-11-09 · Benjamin Guedj, Sylvain Robbiano

This paper is devoted to the bipartite ranking problem, a classical statistical learning task, in a high dimensional setting. We propose a scoring and ranking strategy based on the PAC-Bayesian approach. We consider nonl…

Vocal Bursts Intensity Prediction

Minimax Signal Detection in Sparse Additive Models

2023-04-19 · Subhodh Kotekal, Chao GAO

Sparse additive models are an attractive choice in circumstances calling for modelling flexibility in the face of high dimensionality. We study the signal detection problem and establish the minimax separation rate for t…

Additive models

Near Minimax Optimal Players for the Finite-Time 3-Expert Prediction Problem

2017-12-01 · NeurIPS 2017 12 · Yasin Abbasi, Peter L. Bartlett, Victor Gabillon

We study minimax strategies for the online prediction problem with expert advice. It has been conjectured that a simple adversary strategy, called COMB, is near optimal in this game for any number of experts. Our results…