Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Matej Balog

dblp:166/1616 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
1since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 4 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Probabilistic and Bayesian machine learning · 57% Reinforcement learning · 38% Kernel, tree and ensemble methods · 5%
Theoretical computer science
2 papers
Combinatorics and discrete mathematics · 90% Mathematical optimization · 10%
Network and information security
1 paper
Privacy and data protection · 100%
Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 100%

Topics — the 10 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › model-based reinforcement learning › model-based planning
alphazero-style search
0.812024
Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search · IJCAI 2024
Combinatorics and discrete mathematics › extremal combinatorics
extremal graph theory
0.812024
Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search · IJCAI 2024
Privacy and data protection
differential privacy
0.312018
Differentially Private Database Release via Kernel Mean Embeddings · ICML 2018
Privacy and data protection › differential privacy
synthetic data generation
0.312018
Differentially Private Database Release via Kernel Mean Embeddings · ICML 2018
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
discrete graphical models
0.312017
Lost Relatives of the Gumbel Trick · ICML 2017
Machine learning › Probabilistic and Bayesian machine learning › sampling
gumbel-max trick
0.312017
Lost Relatives of the Gumbel Trick · ICML 2017
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
partition function estimation
0.312017
Lost Relatives of the Gumbel Trick · ICML 2017
Machine learning › Probabilistic and Bayesian machine learning
sampling
0.312017
Lost Relatives of the Gumbel Trick · ICML 2017
Program synthesis and code generation
inductive program synthesis
0.312017
DeepCoder: Learning to Write Programs · ICLR (Poster) 2017
Machine learning › Kernel, tree and ensemble methods › kernel methods
kernel mean embedding
0.112018
Differentially Private Database Release via Kernel Mean Embeddings · ICML 2018

Methods — techniques the papers use, named apart from their topics

tabu search · 1.5alphazero · 1.5synthetic data generation · 0.7reproducing kernel hilbert space · 0.7kernel mean embedding · 0.7sequential sampling · 0.6low-rank perturbation · 0.6gumbel perturbation · 0.6inductive program synthesis · 0.3deep learning · 0.3
YearPublicationVenuePosition
2024 Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search
Abbas Mehrabian, Ankit Anand, Hyunjik Kim, Nicolas Sonnerat, Matej Balog, Gheorghe Comanici, Tudor Berariu, Anian Ruoss, Anna Bulanova, Daniel Toyama, Sam Blackwell, Bernardino Romera-Paredes, Petar Velickovic, Laurent Orseau, Joonkyung Lee, Anurag Murty Naredla, Doina Precup, Zsolt Adam Wagner
IJCAI5
2018 Differentially Private Database Release via Kernel Mean Embeddings
abstract
We lay theoretical foundations for new database release mechanisms that allow third-parties to construct consistent estimators of population statistics, while ensuring that the privacy of each individual contributing to the database is protected. The proposed framework rests on two main ideas. First, releasing (an estimate of) the kernel mean embedding of the data generating random variable instead of the database itself still allows third-parties to construct consistent estimators of a wide class of population statistics. Second, the algorithm can satisfy the definition of differential privacy by basing the released kernel mean embedding on entirely synthetic data points, while controlling accuracy through the metric available in a Reproducing Kernel Hilbert Space. We describe two instantiations of the proposed framework, suitable under different scenarios, and prove theoretical results guaranteeing differential privacy of the resulting algorithms and the consistency of estimators constructed from their outputs.
Matej Balog, Ilya O. Tolstikhin, Bernhard Schölkopf
ICML1
2017 DeepCoder: Learning to Write Programs
Matej Balog, Alexander L. Gaunt, Marc Brockschmidt, Sebastian Nowozin, Daniel Tarlow
ICLR (Poster)1
2017 Lost Relatives of the Gumbel Trick
abstract
The Gumbel trick is a method to sample from a discrete probability distribution, or to estimate its normalizing partition function. The method relies on repeatedly applying a random perturbation to the distribution in a particular way, each time solving for the most likely configuration. We derive an entire family of related methods, of which the Gumbel trick is one member, and show that the new methods have superior properties in several settings with minimal additional computational cost. In particular, for the Gumbel trick to yield computational benefits for discrete graphical models, Gumbel perturbations on all configurations are typically replaced with so-called low-rank perturbations. We show how a subfamily of our new methods adapts to this setting, proving new upper and lower bounds on the log partition function and deriving a family of sequential samplers for the Gibbs distribution. Finally, we balance the discussion by showing how the simpler analytical form of the Gumbel trick enables additional theoretical results.
Matej Balog, Nilesh Tripuraneni, Zoubin Ghahramani, Adrian Weller
ICML1
2016 The Mondrian Kernel
Matej Balog, Balaji Lakshminarayanan, Zoubin Ghahramani, Daniel M. Roy 0001, Yee Whye Teh
UAI1