Skip to content
conftrace_

Rahul Mazumder

26 papers · 2010–2026 · 7 venues · across top CS/AI venues

Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.

Jump to papers ↓
+9 more ↓ 🗺️ Taxonomy Completionist (38) 🏃 Academic Marathon · Full 🌍 Conference Polyglot · Silver 🌉 Interdisciplinary Bridge · Bronze 🐣 Hot Topic Early Bird
🔬 Deep Specialist (11) 👥 Mega-Team · Squad 🧬 Topic Evolution 🧭 Keyword Pioneer 🗃️ Keyword Collector (130) ❓ The Questioner 🔥 Unstoppable · Bronze 💎 Century Club · Bronze ⚡ Prolific Year · Productive

Papers

Theoretical Compression Bounds for Wide Multilayer Perceptrons COLT 2026 Preserving Deep Representations in One-Shot Pruning: A Hessian-Free Second-Order Optimization Framework ICLR 2025 Randomization Can Reduce Both Bias and Variance: A Case Study in Random Forests JMLR 2025 Scaling Down, Serving Fast: Compressing and Deploying Efficient LLMs for Recommendation Systems EMNLP 2025 ALPS: Improved Optimization for Highly Sparse One-Shot Pruning for Large Language Models NeurIPS 2024 End-to-end Feature Selection Approach for Learning Skinny Trees AISTATS 2024 FALCON: FLOP-Aware Combinatorial Optimization for Neural Network Pruning AISTATS 2024 OSSCAR: One-Shot Structured Pruning in Vision and Language Models with Combinatorial Optimization ICML 2024 Sparse NMF with Archetypal Regularization: Computational and Robustness Properties JMLR 2024 Fast as CHITA: Neural Network Pruning with Combinatorial Optimization ICML 2023 ForestPrune: Compact Depth-Pruned Tree Ensembles AISTATS 2023 GRAND-SLAMIN’ Interpretable Additive Modeling with Structural Constraints NeurIPS 2023 L0Learn: A Scalable Package for Sparse Learning using L0 Regularization JMLR 2023 On the Convergence of CART under Sufficient Impurity Decrease Condition NeurIPS 2023 Pushing the limits of fairness impossibility: Who's the fairest of them all? NeurIPS 2022 Quant-BnB: A Scalable Branch-and-Bound Method for Optimal Decision Trees with Continuous Features ICML 2022 Solving L1-regularized SVMs and Related Linear Programs: Revisiting the Effectiveness of Column and Constraint Generation JMLR 2022 DSelect-k: Differentiable Selection in the Mixture of Experts with Applications to Multi-Task Learning NeurIPS 2021 Learning Sparse Classifiers: Continuous and Mixed Integer Optimization Perspectives JMLR 2021 ECLIPSE: An Extreme-Scale Linear Program Solver for Web-Applications ICML 2020 Learning Hierarchical Interactions at Scale: A Convex Optimization Approach AISTATS 2020 The Tree Ensemble Layer: Differentiability meets Conditional Computation ICML 2020 Certifiably Optimal Low Rank Factor Analysis JMLR 2017 Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares JMLR 2015 Exact Covariance Thresholding into Connected Components for Large-Scale Graphical Lasso JMLR 2012 Spectral Regularization Algorithms for Learning Large Incomplete Matrices JMLR 2010