πŸ“ Papers

Section folder view.

Subfolders

Notes

πŸ“„

Note
πŸ“„

A Compression Perspective on Simplicity Bias

Note
πŸ“„

Beyond Neural Scaling Law - Data Pruning improve power law

Note
πŸ“„

Boosting Data-Driven Mirror Descent with Randomization,Equivariance, and Acceleration

Note
πŸ“„

Cram Less to Fit More

Note
πŸ“„

Crowd-Aware Robot Navigation with Switching BetweenLearning-Based and Rule-Based Methods Using Normalizing Flows

Note
πŸ“„

Deep Learning on a Data Diet

Note
πŸ“„

Diffusion-LM

Note
πŸ“„

Information Theory for Repr Learning

Note
πŸ“„

Invariant Risk Minimization

Note
πŸ“„

Large-Scale Pruning using Dyna Uncertainty

Note
πŸ“„

Learned feature representations are biased by complexity, learning order, position, and more

Note
πŸ“„

Learning Stable Normalizing-Flow Control for Robotic Manipulation

Note
πŸ“„

Learning to Theorise

Note
πŸ“„

Learning2Optimize

Note
πŸ“„

MACO-Feature Visualization via Magnitude Constrained Optimization

Note
πŸ“„

MaxEnRL via Energy-based Normalising Flows 1

Note
πŸ“„

Mechanistic Mode Connectivity

Note
πŸ“„

Neural Ordinary Differential Equations

Note
πŸ“„

RecoveryChaining-Learning Local Recovery Policies for Robust Manipulation

Note
πŸ“„

RESPO (Reachability Estimation for Safe Policy Optimization)

Note
πŸ“„

Scaling for Data Filtering

Note
πŸ“„

TIC-CLIP - continual training of clip models

Note
πŸ“„

Understanding BlackBox Predictions - Using Influence Functions

Note
πŸ“„

Understanding Visual Feature Reliance through the Lens of Complexity

Note
πŸ“„

When Do Curricula Work?

Note