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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yaniv Ovadia

dblp:122/8983 · DBLP profile ↗
← Back
4ranked-venue papers
1as 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 · 4 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author

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
Trustworthy machine learning · 50% Deep learning architectures and training · 25% Probabilistic and Bayesian machine learning · 16%
Theoretical computer science
1 paper
Computational geometry · 77% Mathematical optimization · 23%
Computer graphics and multimedia
1 paper
Rendering · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

Topics — the 12 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Rendering
monte carlo rendering
0.812024
Fiber Monte Carlo · ICLR 2024
Machine learning › Deep learning architectures and training
attention mechanism
0.412019
DppNet: Approximating Determinantal Point Processes with Deep Networks · NeurIPS 2019
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › point process
determinantal point process
0.412019
DppNet: Approximating Determinantal Point Processes with Deep Networks · NeurIPS 2019
Machine learning › Trustworthy machine learning › robustness
distribution shift
0.412019
Can you trust your model's uncertainty? Evaluating predictive uncertainty under dataset shift · NeurIPS 2019
Machine learning › Trustworthy machine learning › uncertainty estimation
predictive uncertainty
0.412019
Can you trust your model's uncertainty? Evaluating predictive uncertainty under dataset shift · NeurIPS 2019
Machine learning › Trustworthy machine learning
robustness
0.412019
Can you trust your model's uncertainty? Evaluating predictive uncertainty under dataset shift · NeurIPS 2019
Machine learning › Deep learning architectures and training
transformer
0.412019
DppNet: Approximating Determinantal Point Processes with Deep Networks · NeurIPS 2019
Machine learning › Trustworthy machine learning
uncertainty estimation
0.412019
Can you trust your model's uncertainty? Evaluating predictive uncertainty under dataset shift · NeurIPS 2019
Computer vision › Image recognition and object detection
object counting
0.312017
Learning to Count Mosquitoes for the Sterile Insect Technique · KDD 2017
Medical and health informatics
public health
0.312017
Learning to Count Mosquitoes for the Sterile Insect Technique · KDD 2017
Mathematical optimization › continuous optimization › convex optimization › first-order methods
gradient-based optimization
0.212024
Fiber Monte Carlo · ICLR 2024
Machine learning › Probabilistic and Bayesian machine learning › deep probabilistic models
bayesian deep learning
0.112019
Can you trust your model's uncertainty? Evaluating predictive uncertainty under dataset shift · NeurIPS 2019

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

conditional monte carlo · 1.5automatic differentiation · 1.5multi-objective optimization · 0.6convolutional neural network · 0.6transformer · 0.4post-hoc calibration · 0.4inhibitive attention · 0.4bayesian methods · 0.4
YearPublicationVenuePosition
2024 Fiber Monte Carlo
abstract
Integrals with discontinuous integrands are ubiquitous, arising from discrete structure in applications like topology optimization, graphics, and computational geometry. These integrals are often part of a forward model in an inverse problem where it is necessary to reason backwards about the parameters, ideally using gradient-based optimization. Monte Carlo methods are widely used to estimate the value of integrals, but this results in a non-differentiable approximation that is amenable to neither conventional automatic differentiation nor reparameterization-based gradient methods. This significantly disrupts efforts to integrate machine learning methods in areas that exhibit these discontinuities: physical simulation and robotics, design, graphics, and computational geometry. Although bespoke domain-specific techniques can handle special cases, a general methodology to wield automatic differentiation in these discrete contexts is wanting. We introduce a differentiable variant of the simple Monte Carlo estimator which samples line segments rather than points from the domain. We justify our estimator analytically as conditional Monte Carlo and demonstrate the diverse functionality of the method as applied to image stylization, topology optimization, and computational geometry.
Nick Richardson, Deniz Oktay, Yaniv Ovadia, James C. Bowden, Ryan P. Adams
ICLR3
2019 DppNet: Approximating Determinantal Point Processes with Deep Networks
abstract
Determinantal point processes (DPPs) provide an elegant and versatile way to sample sets of items that balance the point-wise quality with the set-wise diversity of selected items. For this reason, they have gained prominence in many machine learning applications that rely on subset selection. However, sampling from a DPP over a ground set of size N is a costly operation, requiring in general an O(N^3) preprocessing cost and an O(Nk^3) sampling cost for subsets of size k. We approach this problem by introducing DppNets: generative deep models that produce DPP-like samples for arbitrary ground sets. We develop an inhibitive attention mechanism based on transformer networks that captures a notion of dissimilarity between feature vectors. We show theoretically that such an approximation is sensible as it maintains the guarantees of inhibition or dissimilarity that makes DPPs so powerful and unique. Empirically, we show across multiple datasets that DPPNET is orders of magnitude faster than competing approaches for DPP sampling, while generating high-likelihood samples and performing as well as DPPs on downstream tasks.
Zelda Mariet, Yaniv Ovadia, Jasper Snoek
NeurIPS2
2019 Can you trust your model's uncertainty? Evaluating predictive uncertainty under dataset shift
abstract
Modern machine learning methods including deep learning have achieved great success in predictive accuracy for supervised learning tasks, but may still fall short in giving useful estimates of their predictive uncertainty. Quantifying uncertainty is especially critical in real-world settings, which often involve input distributions that are shifted from the training distribution due to a variety of factors including sample bias and non-stationarity. In such settings, well calibrated uncertainty estimates convey information about when a model's output should (or should not) be trusted. Many probabilistic deep learning methods, including Bayesian-and non-Bayesian methods, have been proposed in the literature for quantifying predictive uncertainty, but to our knowledge there has not previously been a rigorous large-scale empirical comparison of these methods under dataset shift. We present a large-scale benchmark of existing state-of-the-art methods on classification problems and investigate the effect of dataset shift on accuracy and calibration. We find that traditional post-hoc calibration does indeed fall short, as do several other previous methods. However, some methods that marginalize over models give surprisingly strong results across a broad spectrum of tasks.
Jasper Snoek, Yaniv Ovadia, Emily Fertig, Balaji Lakshminarayanan, Sebastian Nowozin, D. Sculley, Joshua V. Dillon, Jie Ren 0006, Zachary Nado
NeurIPS2
2017 Learning to Count Mosquitoes for the Sterile Insect Technique
abstract
Mosquito-borne illnesses such as dengue, chikungunya, and Zika are major global health problems, which are not yet addressable with vaccines and must be countered by reducing mosquito populations. The Sterile Insect Technique (SIT) is a promising alternative to pesticides; however, effective SIT relies on minimal releases of female insects. This paper describes a multi-objective convolutional neural net to significantly streamline the process of counting male and female mosquitoes released from a SIT factory and provides a statistical basis for verifying strict contamination rate limits from these counts despite measurement noise. These results are a promising indication that such methods may dramatically reduce the cost of effective SIT methods in practice.
Yaniv Ovadia, Yoni Halpern, Dilip Krishnan, Josh Livni, Daniel E. Newburger, Ryan Poplin, Tiantian Zha, D. Sculley
KDD1