Co-occurring keywords · papers mentioning both
Papers
Efficient Off-Policy Learning for High-Dimensional Action Spaces
ICLR 2025
End-to-End Learning Framework for Solving Non-Markovian Optimal Control
ICML 2025
Enhanced Adaptive Gradient Algorithms for Nonconvex-PL Minimax Optimization
AISTATS 2025
Exact Recovery of Sparse Binary Vectors from Generalized Linear Measurements
ICML 2025
Exploiting Approximate Symmetry for Efficient Multi-Agent Reinforcement Learning
L4DC 2025
Exploiting inter-agent coupling information for efficient reinforcement learning of cooperative LQR
L4DC 2025
Fast and Provable Algorithms for Sparse PCA with Improved Sample Complexity
ICML 2025
Fast Non-convex Matrix Sensing with Optimal Sample Complexity
UAI 2025
Feature learning from non-Gaussian inputs: the case of Independent Component Analysis in high dimensions
ICML 2025
Finite Sample Analysis of Tensor Decomposition for Learning Mixtures of Linear Systems
L4DC 2025
Finite Sample Identification of Partially Observed Bilinear Dynamical Systems
L4DC 2025
From Gradient Clipping to Normalization for Heavy Tailed SGD
AISTATS 2025
Fundamental computational limits of weak learnability in high-dimensional multi-index models
AISTATS 2025
Gaussian Mean Testing under Truncation
AISTATS 2025
Generalization Analysis for Deep Contrastive Representation Learning
AAAI 2025
Generalization Bounds for Canonicalization: A Comparative Study with Group Averaging
ICLR 2025
Generative or Discriminative? Revisiting Text Classification in the Era of Transformers
EMNLP 2025
Guided Zeroth-Order Methods for Stochastic Non-convex Problems with Decision-Dependent Distributions
ICML 2025
How Compositional Generalization and Creativity Improve as Diffusion Models are Trained
ICML 2025
How many samples are needed to train a deep neural network?
ICLR 2025
How Much is a Noisy Image Worth? Data Scaling Laws for Ambient Diffusion.
ICLR 2025
How to Verify Any (Reasonable) Distribution Property: Computationally Sound Argument Systems for Distributions
ICLR 2025
Hybrid Transfer Reinforcement Learning: Provable Sample Efficiency from Shifted-Dynamics Data
AISTATS 2025
Improved algorithms for learning quantum Hamiltonians, via flat polynomials
COLT 2025
Improved Lower Bounds for First-order Stochastic Non-convex Optimization under Markov Sampling
ICML 2025