Summary of Count-based Novelty Exploration in Classical Planning, by Giacomo Rosa and Nir Lipovetzky
Count-based Novelty Exploration in Classical Planningby Giacomo Rosa, Nir LipovetzkyFirst submitted to arxiv on: 25…
Count-based Novelty Exploration in Classical Planningby Giacomo Rosa, Nir LipovetzkyFirst submitted to arxiv on: 25…
Learning Valid Dual Bounds in Constraint Programming: Boosted Lagrangian Decomposition with Self-Supervised Learningby Swann Bessa,…
TReX- Reusing Vision Transformer’s Attention for Efficient Xbar-based Computingby Abhishek Moitra, Abhiroop Bhattacharjee, Youngeun Kim,…
Not All Samples Should Be Utilized Equally: Towards Understanding and Improving Dataset Distillationby Shaobo Wang,…
Antidote: Post-fine-tuning Safety Alignment for Large Language Models against Harmful Fine-tuningby Tiansheng Huang, Gautam Bhattacharya,…
On the Completeness of Conflict-Based Search: Temporally-Relative Duplicate Pruningby Thayne T Walker, Nathan R SturtevantFirst…
PQV-Mobile: A Combined Pruning and Quantization Toolkit to Optimize Vision Transformers for Mobile Applicationsby Kshitij…
Surgical SAM 2: Real-time Segment Anything in Surgical Video by Efficient Frame Pruningby Haofeng Liu,…
ThinK: Thinner Key Cache by Query-Driven Pruningby Yuhui Xu, Zhanming Jie, Hanze Dong, Lei Wang,…
Greedy Output Approximation: Towards Efficient Structured Pruning for LLMs Without Retrainingby Jianwei Li, Yijun Dong,…