Fast Excess Risk Rates via Offset Rademacher Complexity

Chenguang Duan, Yuling Jiao, Lican Kang, Xiliang Lu, J. Yang
2/12/2026

No confident code implementation found for this paper.

Semantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Improving Graph Contrastive Learning via Adaptive Positive Sampling

100% match2026

Extracting Rare Dependence Patterns via Adaptive Sample Reweighting

100% match1 repo72026

Learning Fair Graph Representations via Automated Data Augmentations

100% match2026

Towards Lifelong Model Editing via Simulating Ideal Editor

100% match2026

Data Efficient Neural Scaling Law via Model Reusing

100% match1 repo142026

Discrete Latent Plans via Semantic Skill Abstractions

100% match1 repo62026

Cite this paper

@article{duan2026fast,
  title  = {Fast Excess Risk Rates via Offset Rademacher Complexity},
  author = {Chenguang Duan and Yuling Jiao and Lican Kang and Xiliang Lu and J. Yang},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:5ac355688249014230b64dcf356650609da8e30e},
  journal = {ICML 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/5ac355688249014230b64dcf356650609da8e30e.svg)](https://codeofpaper.com/paper/5ac355688249014230b64dcf356650609da8e30e)

Discussion