Skip to content
conftrace_

Papers (including subtopics)

On the expressiveness and spectral bias of KANs ICLR 2025 On the Expressiveness of Rational ReLU Neural Networks With Bounded Depth ICLR 2025 On the Feature Learning in Diffusion Models ICLR 2025 On the Generalization of Feature Incremental Learning IJCAI 2025 On the Generalization vs Fidelity Paradox in Knowledge Distillation ACL 2025 On the Hardness of Bandit Learning COLT 2025 On the Hardness of Learning One Hidden Layer Neural Networks ALT 2025 On the Hardness of Training Deep Neural Networks Discretely AAAI 2025 On the Importance of Embedding Norms in Self-Supervised Learning ICML 2025 On the Inherent Privacy of Zeroth-Order Projected Gradient Descent AISTATS 2025 On the Interplay between Graph Structure and Learning Algorithms in Graph Neural Networks ICML 2025 On the Interplay between Positional Encodings, Morphological Complexity, and Word Order Flexibility IJCNLP 2025 On the Learnability of Distribution Classes with Adaptive Adversaries ICML 2025 On the Learn-to-Optimize Capabilities of Transformers in In-Context Sparse Recovery ICLR 2025 On the Local Complexity of Linear Regions in Deep ReLU Networks ICML 2025 On the Logic of Theory Base Change: Reformulation of Belief Bases AAAI 2025 On the Minimax Regret of Sequential Probability Assignment via Square-Root Entropy COLT 2025 On the Modelling of Constraints with Tractable Logical Operators AAAI 2025 On the Natural Gradient of the Evidence Lower Bound JMLR 2025 On the Optimal Memorization Capacity of Transformers ICLR 2025 On the Optimization Landscape of Low Rank Adaptation Methods for Large Language Models ICLR 2025 On the O(sqrt(d)/T^(1/4)) Convergence Rate of RMSProp and Its Momentum Extension Measured by l_1 Norm JMLR 2025 On the Out-of-Distribution Generalization of Self-Supervised Learning ICML 2025 On the Performance Analysis of Momentum Method: A Frequency Domain Perspective ICLR 2025 On the Power of Multitask Representation Learning with Gradient Descent AISTATS 2025