:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Truong, Lan V.
Format:	Preprint
Published:	2022
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2208.04284
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Global Convergence Rate of Deep Equilibrium Models with General Activations
by: Truong, Lan V.
Published: (2023)

On Rank-Dependent Generalisation Error Bounds for Transformers
by: Truong, Lan V.
Published: (2024)

Lean Formalization of Generalization Error Bound by Rademacher Complexity and Dudley's Entropy Integral
by: Sonoda, Sho, et al.
Published: (2025)

Bridging the Gap: Rademacher Complexity in Robust and Standard Generalization
by: Xiao, Jiancong, et al.
Published: (2024)

A Gapped Scale-Sensitive Dimension and Lower Bounds for Offset Rademacher Complexity
by: Jia, Zeyu, et al.
Published: (2025)

Optimal Best-Arm Identification under Fixed Confidence with Multiple Optima
by: Truong, Lan V.
Published: (2025)

Rademacher Complexity of Neural ODEs via Chen-Fliess Series
by: Hanson, Joshua, et al.
Published: (2024)

Impact of Positional Encoding: Clean and Adversarial Rademacher Complexity for Transformers under In-Context Regression
by: He, Weiyi, et al.
Published: (2025)

RCR-AF: Enhancing Model Generalization via Rademacher Complexity Reduction Activation Function
by: Yu, Yunrui, et al.
Published: (2025)

Rademacher Meets Colors: More Expressivity, but at What Cost ?
by: Carrasco, Martin, et al.
Published: (2025)

One-Step Early Stopping Strategy using Neural Tangent Kernel Theory and Rademacher Complexity
by: Xavier, Daniel Martin, et al.
Published: (2024)

Do we really need the Rademacher complexities?
by: Bartl, Daniel, et al.
Published: (2025)

Resilience of Rademacher chaos of low degree
by: Aigner-Horev, Elad, et al.
Published: (2024)

Graph Attention-based Deep Reinforcement Learning for solving the Chinese Postman Problem with Load-dependent costs
by: Hy, Truong Son, et al.
Published: (2023)

Weisfeiler and Lehman Go Paths: Learning Topological Features via Path Complexes
by: Truong, Quang, et al.
Published: (2023)

Disentangled and Distilled Encoder for Out-of-Distribution Reasoning with Rademacher Guarantees
by: Rahiminasab, Zahra, et al.
Published: (2025)

Data Normalization Strategies for EEG Deep Learning
by: Truong, Dung, et al.
Published: (2025)

A Margin-based Multiclass Generalization Bound via Geometric Complexity
by: Munn, Michael, et al.
Published: (2024)

Transformers Learn Robust In-Context Regression under Distributional Uncertainty
by: Cao, Hoang T. H., et al.
Published: (2026)

Interactive Multi-Objective Probabilistic Preference Learning with Soft and Hard Bounds
by: Chen, Edward, et al.
Published: (2025)

Efficient Deep Learning for Medical Imaging: Bridging the Gap Between High-Performance AI and Clinical Deployment
by: Nguyen, Cuong Manh, et al.
Published: (2026)

On the Koopman-Based Generalization Bounds for Multi-Task Deep Learning
by: Mohammadigohari, Mahdi, et al.
Published: (2025)

Rademacher learning rates for iterated random functions
by: Sandrić, Nikola
Published: (2025)

Information-Theoretic Generalization Bounds of Replay-based Continual Learning
by: Wen, Wen, et al.
Published: (2025)

Locally Linear Continual Learning for Time Series based on VC-Theoretical Generalization Bounds
by: Ferreira, Yan V. G., et al.
Published: (2026)

Operator-Based Generalization Bound for Deep Learning: Insights on Multi-Task Learning
by: Mohammadigohari, Mahdi, et al.
Published: (2025)

Spectrum-Adaptive Generalization Bounds for Trained Deep Transformers
by: Sakai, Mana, et al.
Published: (2026)

On The Sample Complexity Bounds In Bilevel Reinforcement Learning
by: Gaur, Mudit, et al.
Published: (2025)

Convergence of Adam in Deep ReLU Networks via Directional Complexity and Kakeya Bounds
by: Sridhar, Anupama, et al.
Published: (2025)

Improved Generalization Bounds for Transductive Learning by Transductive Local Complexity and Its Applications
by: Yang, Yingzhen
Published: (2023)

From Low Intrinsic Dimensionality to Non-Vacuous Generalization Bounds in Deep Multi-Task Learning
by: Zakerinia, Hossein, et al.
Published: (2025)

Decoding Motor Behavior Using Deep Learning and Reservoir Computing
by: Lan, Tian
Published: (2025)

Sample Complexity Bounds for Linear Constrained MDPs with a Generative Model
by: Liu, Xingtu, et al.
Published: (2025)

Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model
by: Tarbouriech, Jean, et al.
Published: (2026)

A General Constructive Upper Bound on Shallow Neural Nets Complexity
by: Hakl, Frantisek, et al.
Published: (2025)

Lower Bounds for the Algorithmic Complexity of Learned Indexes
by: Croquevielle, Luis Alberto, et al.
Published: (2026)

Norm-Hierarchy Transitions in Representation Learning: When and Why Neural Networks Abandon Shortcuts
by: Khanh, Truong Xuan, et al.
Published: (2026)

Stability-based Generalization Bounds for Variational Inference
by: Wei, Yadi, et al.
Published: (2025)

Generalization Bounds and Model Complexity for Kolmogorov-Arnold Networks
by: Zhang, Xianyang, et al.
Published: (2024)

Improved Information Theoretic Generalization Bounds for Distributed and Federated Learning
by: Barnes, L. P., et al.
Published: (2022)