World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
56
Citations
18221
World Ranking
3980
National Ranking
1894

Research.com Recognitions

  • 2014 - Fellow of Alfred P. Sloan Foundation

Overview

Pradeep Ravikumar is affiliated with Carnegie Mellon University in the United States and has a substantial record of contributions in the field of computer science, particularly focusing on artificial intelligence and related subfields. Their research encompasses a wide range of topics within machine learning and its applications.

Ravikumar's recent published papers include the following:

  • The Risks of Invariant Risk Minimization, 2020, arXiv (Cornell University)
  • MACER: Attack-free and Scalable Robust Training via Maximizing Certified Radius, 2020, arXiv (Cornell University)
  • Sub-Seasonal Climate Forecasting via Machine Learning: Challenges, Analysis, and Advances, 2021, Proceedings of the AAAI Conference on Artificial Intelligence
  • Faith-Shap: The Faithful Shapley Interaction Index, 2022, arXiv (Cornell University)
  • Certified Robustness to Label-Flipping Attacks via Randomized Smoothing, 2020, arXiv (Cornell University)

The frequent co-authors of Ravikumar's work include:

  • Bryon Aragam, with 15 collaborations
  • Chih-Kuan Yeh, with 10 collaborations
  • Dan Chen, with 8 collaborations
  • Elan Rosenfeld, with 8 collaborations
  • Andrej Risteski, with 8 collaborations

Ravikumar has published extensively in several venues, predominantly in arXiv hosted by Cornell University with 54 papers. Other publication venues include:

  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Journal of the Royal Statistical Society Series B (Statistical Methodology)
  • Applied AI Letters
  • The Annals of Statistics

The main fields of study for Ravikumar are centered on computer science, with a strong focus on artificial intelligence. The subfields further detail their areas of expertise as:

  • Artificial Intelligence
  • Statistics and Probability
  • Management Science and Operations Research
  • Computer Vision and Pattern Recognition
  • Control and Systems Engineering

The primary topics of their research work cover:

  • Adversarial Robustness in Machine Learning
  • Domain Adaptation and Few-Shot Learning
  • Machine Learning and Algorithms
  • Explainable Artificial Intelligence (XAI)
  • Machine Learning and Data Classification
  • Anomaly Detection Techniques and Applications
  • Bayesian Modeling and Causal Inference

In recognition of their work, Pradeep Ravikumar was awarded the title of Fellow of the Alfred P. Sloan Foundation in 2014.

Best Publications

  • A comparison of string distance metrics for name-matching tasks

    William W. Cohen;Pradeep Ravikumar;Stephen E. Fienberg

  • A Unified Framework for High-Dimensional Analysis of $M$-Estimators with Decomposable Regularizers

    Sahand N. Negahban;Pradeep Ravikumar;Martin J. Wainwright;Bin Yu

  • High-dimensional Ising model selection using ℓ1-regularized logistic regression

    Pradeep Ravikumar;Martin J. Wainwright;John D. Lafferty

  • High-dimensional covariance estimation by minimizing ℓ1-penalized log-determinant divergence

    Pradeep Ravikumar;Martin J. Wainwright;Garvesh Raskutti;Bin Yu

  • Learning with Noisy Labels

    Nagarajan Natarajan;Inderjit S Dhillon;Pradeep K Ravikumar;Ambuj Tewari

  • Sparse Additive Models

    Pradeep Ravikumar;John Lafferty;Han Liu;Larry Wasserman

  • Adaptive name matching in information integration

    M. Bilenko;R. Mooney;W. Cohen;P. Ravikumar

  • High-dimensional Ising model selection using ${ll_1}$-regularized logistic regression

    Pradeep Ravikumar;Martin J. Wainwright;John D. Lafferty

  • A Dirty Model for Multi-task Learning

    Ali Jalali;Sujay Sanghavi;Chao Ruan;Pradeep K. Ravikumar

  • DAGs with NO TEARS: Continuous Optimization for Structure Learning

    Xun Zheng;Bryon Aragam;Pradeep K. Ravikumar;Eric P. Xing

  • Sparse Inverse Covariance Matrix Estimation Using Quadratic Approximation

    Cho-jui Hsieh;Inderjit S. Dhillon;Pradeep K. Ravikumar;Mátyás A. Sustik

  • Information-theoretic lower bounds on the oracle complexity of convex optimization

    Alekh Agarwal;Peter L. Bartlett;Pradeep Ravikumar;Martin J. Wainwright

  • A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers

    Sahand Negahban;Bin Yu;Martin J Wainwright;Pradeep K. Ravikumar

  • Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization

    A. Agarwal;P. L. Bartlett;P. Ravikumar;M. J. Wainwright

  • Collaborative filtering with graph information: consistency and scalable methods

    Nikhil Rao;Hsiang-Fu Yu;Pradeep Ravikumar;Inderjit S. Dhillon

  • High-Dimensional Graphical Model Selection Using ell_1-Regularized Logistic Regression

    Martin J Wainwright;John D. Lafferty;Pradeep K. Ravikumar

  • BIG & QUIC: Sparse Inverse Covariance Estimation for a Million Variables

    Cho-Jui Hsieh;Matyas A Sustik;Inderjit S Dhillon;Pradeep K Ravikumar

  • QUIC: quadratic approximation for sparse inverse covariance estimation

    Cho-Jui Hsieh;Mátyás A. Sustik;Inderjit S. Dhillon;Pradeep Ravikumar

  • On the (In)fidelity and Sensitivity of Explanations

    Chih-Kuan Yeh;Cheng-Yu Hsieh;Arun Sai Suggala;David I. Inouye

  • Graphical models via univariate exponential family distributions

    Eunho Yang;Pradeep Ravikumar;Genevera I. Allen;Zhandong Liu

  • Representer Point Selection for Explaining Deep Neural Networks

    Chih-Kuan Yeh;Joon Sik Kim;Ian En-Hsu Yen;Pradeep Ravikumar

  • Learning Sparse Nonparametric DAGs

    Xun Zheng;Chen Dan;Bryon Aragam;Pradeep Ravikumar

  • On the (In)fidelity and Sensitivity for Explanations.

    Chih-Kuan Yeh;Cheng-Yu Hsieh;Arun Sai Suggala;David I. Inouye

Frequent Co-Authors

Inderjit S. Dhillon
Inderjit S. Dhillon Google (United States)
Cho-Jui Hsieh
Cho-Jui Hsieh University of California, Los Angeles
John Lafferty
John Lafferty Yale University
Eric P. Xing
Eric P. Xing Mohamed bin Zayed University of Artificial Intelligence
Bin Yu
Bin Yu University of California, Berkeley
Ambuj Tewari
Ambuj Tewari University of Michigan–Ann Arbor
Alekh Agarwal
Alekh Agarwal Google (United States)
William W. Cohen
William W. Cohen Carnegie Mellon University
Arindam Banerjee
Arindam Banerjee University of Illinois at Urbana-Champaign

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science opens doors to a variety of flexible learning options, especially for those looking to study online. An online associate's degree in computer science is a great starting point, offering foundational skills and a pathway to further study or entry-level tech jobs.

Many students search for cheap online degrees fast as a way to save time and reduce education costs. These programs are ideal for budget-conscious learners and those who want to quickly transition into the workforce.

Don’t let academic setbacks hold you back—several online colleges that accept low gpa offer accessible pathways to a computer science degree, providing support systems to help students succeed.

Careers in computer science are diverse, intersecting with fields like data analytics, artificial intelligence, or even environmental science. If you’re wondering about interdisciplinary opportunities, exploring what can i do with an environmental science degree might broaden your perspective on innovative, tech-driven career paths.

Best Scientists Citing Pradeep Ravikumar

Trending Scientists