What is he best known for?
The fields of study he is best known for:
- Artificial intelligence
- Machine learning
- Algorithm
The scientist’s investigation covers issues in Algorithm, Artificial intelligence, Combinatorics, Time complexity and Theoretical computer science.
His Algorithm research also works with subjects such as
- Perceptron that connect with fields like Node and Linear programming,
- Computational learning theory which is related to area like Instance-based learning.
His Artificial intelligence study combines topics from a wide range of disciplines, such as Machine learning and Power graph analysis.
His studies in Combinatorics integrate themes in fields like Discrete mathematics and Correlation clustering, Cluster analysis.
His work deals with themes such as Concept class, Polynomial, Focus and Greedy algorithm, which intersect with Time complexity.
His Theoretical computer science research is multidisciplinary, incorporating perspectives in Differential privacy and Learning theory.
His most cited work include:
- Combining labeled and unlabeled data with co-training (4384 citations)
- Selection of relevant features and examples in machine learning (2577 citations)
- Fast planning through planning graph analysis (1442 citations)
What are the main themes of his work throughout his whole career to date?
His scientific interests lie mostly in Artificial intelligence, Combinatorics, Algorithm, Machine learning and Discrete mathematics.
As part of one scientific family, Avrim Blum deals mainly with the area of Artificial intelligence, narrowing it down to issues related to the Theoretical computer science, and often Differential privacy.
As a member of one scientific family, Avrim Blum mostly works in the field of Combinatorics, focusing on Function and, on occasion, Mathematical optimization.
His study in Algorithm is interdisciplinary in nature, drawing from both Training set and Polynomial.
His Approximation algorithm research is multidisciplinary, incorporating elements of Travelling salesman problem and Orienteering.
His Computational learning theory research incorporates elements of Instance-based learning and Algorithmic learning theory.
He most often published in these fields:
- Artificial intelligence (24.41%)
- Combinatorics (21.36%)
- Algorithm (18.31%)
What were the highlights of his more recent work (between 2014-2021)?
- Artificial intelligence (24.41%)
- Machine learning (17.29%)
- Combinatorics (21.36%)
In recent papers he was focusing on the following fields of study:
His primary areas of investigation include Artificial intelligence, Machine learning, Combinatorics, Theoretical computer science and Mathematical optimization.
The concepts of his Artificial intelligence study are interwoven with issues in Competition and Advice.
His work on Feature and Decision tree as part of general Machine learning study is frequently linked to Lifelong learning and Order, bridging the gap between disciplines.
His studies in Combinatorics integrate themes in fields like Function, Small number, Discrete mathematics and Convex hull.
The Theoretical computer science study which covers Topic model that intersects with Probability distribution.
His Mathematical optimization study combines topics from a wide range of disciplines, such as Uniform convergence, Graph and Regret.
Between 2014 and 2021, his most popular works were:
- Foundations of Data Science (120 citations)
- Commitment Without Regrets: Online Learning in Stackelberg Security Games (53 citations)
- The Ladder: A Reliable Leaderboard for Machine Learning Competitions (44 citations)
In his most recent research, the most cited papers focused on:
- Artificial intelligence
- Machine learning
- Algorithm
Avrim Blum mostly deals with Artificial intelligence, Graph, Odds, Discrete mathematics and Machine learning.
In the subject of general Artificial intelligence, his work in Semi-supervised learning is often linked to Sample complexity, thereby combining diverse domains of study.
His work carried out in the field of Graph brings together such families of science as Algorithm, Directed graph and Mathematical optimization.
The various areas that Avrim Blum examines in his Discrete mathematics study include Dimension, Combinatorics, Convex hull, Sparse approximation and Ball.
His Combinatorics study combines topics in areas such as Function, Adaptive algorithm, Special case and Hausdorff distance.
His study in the fields of Overfitting under the domain of Machine learning overlaps with other disciplines such as Quality.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
