Skip to content
conftrace_

Ravi Kumar

71 papers · 2008–2026 · 11 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 ↓
+16 more ↓ πŸ—ΊοΈ Taxonomy Completionist (67) πŸŒ‰ Interdisciplinary Bridge Β· Silver 🌍 Conference Polyglot Β· Gold πŸƒ Academic Marathon Β· Full 🐣 Hot Topic Early Bird
🏠 Conference Loyalist (24) πŸ”¬ Deep Specialist (23) 🌟 Keyword Trendsetter Combo (3) πŸ‘‘ Triple Crown 🀝 Dynamic Duo (36) πŸ† Keyword Champion πŸ† Grand Slam 🧭 Keyword Pioneer πŸš€ Conference Pioneer πŸ”₯ Unstoppable Β· Silver ❓ The Questioner ⚑ Prolific Year Β· Prolific πŸ’Ž Century Club Β· Silver 🌈 Renaissance Researcher (6) πŸ“ˆ Trend Setter πŸ—ƒοΈ Keyword Collector (266)

Papers

Adaptive Weighted Averaging COLT 2026 Fixed-Parameter Tractability of Private Synthetic Data Generation COLT 2026 Nearly Linear-Time User-Level DP-SCO with Optimal Rates COLT 2026 Balls-and-Bins Sampling for DP-SGD AISTATS 2025 Descent with Misaligned Gradients and Applications to Hidden Convexity ICLR 2025 LAuReL: Learned Augmented Residual Layer ICML 2025 On Memorization of Large Language Models in Logical Reasoning IJCNLP 2025 PREM: Privately Answering Statistical Queries with Relative Error COLT 2025 Scaling Laws for Differentially Private Language Models ICML 2025 Unlearn and Burn: Adversarial Machine Unlearning Requests Destroy Model Accuracy ICLR 2025 Differentially Private Optimization with Sparse Gradients NeurIPS 2024 How Private are DP-SGD Implementations? ICML 2024 Individualized Privacy Accounting via Subsampling with Applications in Combinatorial Optimization ICML 2024 LabelDP-Pro: Learning with Label Differential Privacy via Projections ICLR 2024 On Convex Optimization with Semi-Sensitive Features COLT 2024 Scalable DP-SGD: Shuffling vs. Poisson Subsampling NeurIPS 2024 Tight Bounds for Learning RUMs from Small Slates NeurIPS 2024 Approximating a RUM from Distributions on k-Slates AISTATS 2023 Bandit Online Linear Optimization with Hints and Queries ICML 2023 Differentially Private Heatmaps AAAI 2023 On Computing Pairwise Statistics with Local Differential Privacy NeurIPS 2023 On Differentially Private Sampling from Gaussian and Product Distributions NeurIPS 2023 On User-Level Private Convex Optimization ICML 2023 Optimal Unbiased Randomizers for Regression with Label Differential Privacy NeurIPS 2023 Regression with Label Differential Privacy ICLR 2023 Sparsity-Preserving Differentially Private Training of Large Embedding Models NeurIPS 2023 Ticketed Learning–Unlearning Schemes COLT 2023 User-Level Differential Privacy With Few Examples Per User NeurIPS 2023 Anonymized Histograms in Intermediate Privacy Models NeurIPS 2022 Faster Privacy Accounting via Evolving Discretization ICML 2022 Large-Scale Differentially Private BERT EMNLP 2022 Parsimonious Learning-Augmented Caching ICML 2022 Private Isotonic Regression NeurIPS 2022 Private Rank Aggregation in Central and Local Models AAAI 2022 RUMs from Head-to-Head Contests ICML 2022 Deep Learning with Label Differential Privacy NeurIPS 2021 Differentially Private Aggregation in the Shuffle Model: Almost Central Accuracy in Almost a Single Message ICML 2021 Light RUMs ICML 2021 Locally Private k-Means in One Round ICML 2021 Logarithmic Regret from Sublinear Hints NeurIPS 2021 Near-tight Closure Bounds for the Littlestone and Threshold Dimensions ALT 2021 On Avoiding the Union Bound When Answering Multiple Differentially Private Queries COLT 2021 Online Knapsack with Frequency Predictions NeurIPS 2021 Power of Hints for Online Learning with Movement Costs AISTATS 2021 Robust and Private Learning of Halfspaces AISTATS 2021 User-Level Differentially Private Learning via Correlated Sampling NeurIPS 2021 Differentially Private Clustering: Tight Approximation Ratios NeurIPS 2020 Fair Correlation Clustering AISTATS 2020 Fair Hierarchical Clustering NeurIPS 2020 Online Learning with Imperfect Hints ICML 2020 Online Linear Optimization with Many Hints NeurIPS 2020 Private Counting from Anonymous Messages: Near-Optimal Accuracy with Vanishing Communication Overhead ICML 2020 Efficient Rematerialization for Deep Networks NeurIPS 2019 Faster Algorithms for Binary Matrix Factorization ICML 2019 Matroids, Matchings, and Fairness AISTATS 2019 Testing Mixtures of Discrete Distributions COLT 2019 Improving Online Algorithms via ML Predictions NeurIPS 2018 Learning a Mixture of Two Multinomial Logits ICML 2018 Mallows Models for Top-k Lists NeurIPS 2018 Algorithms for β„“_p Low-Rank Approximation ICML 2017 Fair Clustering Through Fairlets NeurIPS 2017 Conversational Flow in Oxford-style Debates NAACL 2016 On Mixtures of Markov Chains NeurIPS 2016 Sketching, Embedding and Dimensionality Reduction in Information Theoretic Spaces AISTATS 2016 Near-Optimal Bounds for Cross-Validation via Loss Stability ICML 2013 Summarization Through Submodularity and Dispersion ACL 2013 Selecting Diverse Features via Spectral Regularization NeurIPS 2012 Search in the Lost Sense of β€œQuery”: Question Formulation in Web Search Queries and its Temporal Changes ACL 2011 For a few dollars less: Identifying review pages sans human labels NAACL 2009 Matching Reviews to Objects using a Language Model EMNLP 2009 Mortal Multi-Armed Bandits NeurIPS 2008