What can online reinforcement learning with function approximation benefit from general coverage conditions? Paper • 2304.12886 • Published Apr 25, 2023
Maximum Independent Set: Self-Training through Dynamic Programming Paper • 2310.18672 • Published Oct 28, 2023 • 1
Benign Overfitting in Deep Neural Networks under Lazy Training Paper • 2305.19377 • Published May 30, 2023
Efficient local linearity regularization to overcome catastrophic overfitting Paper • 2401.11618 • Published Jan 21, 2024
Leveraging the Context through Multi-Round Interactions for Jailbreaking Attacks Paper • 2402.09177 • Published Feb 14, 2024
Advancing the lower bounds: An accelerated, stochastic, second-order method with optimal adaptation to inexactness Paper • 2309.01570 • Published Sep 4, 2023
DiGress: Discrete Denoising diffusion for graph generation Paper • 2209.14734 • Published Sep 29, 2022 • 1
Going beyond Compositions, DDPMs Can Produce Zero-Shot Interpolations Paper • 2405.19201 • Published May 29, 2024
Inference Optimization of Foundation Models on AI Accelerators Paper • 2407.09111 • Published Jul 12, 2024
Revisiting SMoE Language Models by Evaluating Inefficiencies with Task Specific Expert Pruning Paper • 2409.01483 • Published Sep 2, 2024