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

Tania Bedrax-Weiss

dblp:48/6510 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
2since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 7 · 2 since 2021Software engineering, systems software and programming languages · 1

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
5 papers
Question answering and dialogue systems · 39% Trustworthy machine learning · 12% 3D vision · 12%
Databases, data mining, and information retrieval
2 papers
Knowledge graphs · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Question answering and dialogue systems › dialogue modeling
dialogue structure modeling
0.712023
Using Domain Knowledge to Guide Dialog Structure Induction via Neural Probabilistic Soft Logic · ACL (1) 2023
Computer vision › 3D vision › depth perception
distance perception
0.412020
Simple and Principled Uncertainty Estimation with Deterministic Deep Learning via Distance Awareness · NeurIPS 2020
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process
0.412020
Simple and Principled Uncertainty Estimation with Deterministic Deep Learning via Distance Awareness · NeurIPS 2020
Natural language and speech › Question answering and dialogue systems
knowledge base question answering
0.412020
Faithful Embeddings for Knowledge Base Queries · NeurIPS 2020
Machine learning › Deep learning architectures and training › normalization
spectral normalization
0.412020
Simple and Principled Uncertainty Estimation with Deterministic Deep Learning via Distance Awareness · NeurIPS 2020
Machine learning › Trustworthy machine learning
uncertainty estimation
0.412020
Simple and Principled Uncertainty Estimation with Deterministic Deep Learning via Distance Awareness · NeurIPS 2020
Knowledge graphs
query embedding
0.412020
Faithful Embeddings for Knowledge Base Queries · NeurIPS 2020
Natural language and speech › Question answering and dialogue systems
open-domain question answering
0.412019
PullNet: Open Domain Question Answering with Iterative Retrieval on Knowledge Bases and Text · EMNLP/IJCNLP (1) 2019
Knowledge, reasoning and agents › Knowledge representation and reasoning › probabilistic reasoning › probabilistic logic
probabilistic soft logic
0.212023
Using Domain Knowledge to Guide Dialog Structure Induction via Neural Probabilistic Soft Logic · ACL (1) 2023
Knowledge graphs
knowledge graph reasoning
0.112019
PullNet: Open Domain Question Answering with Iterative Retrieval on Knowledge Bases and Text · EMNLP/IJCNLP (1) 2019

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

query embedding · 0.9neural question answering · 0.9deductive reasoning · 0.9graph neural network · 0.8neural probabilistic soft logic · 0.7domain knowledge · 0.7weight normalization · 0.4minimax learning · 0.4web data mining · 0.4unsupervised learning · 0.4iterative retrieval · 0.4
YearPublicationVenuePosition
2023 Using Domain Knowledge to Guide Dialog Structure Induction via Neural Probabilistic Soft Logic
abstract
Connor Pryor, Quan Yuan, Jeremiah Liu, Mehran Kazemi, Deepak Ramachandran, Tania Bedrax-Weiss, Lise Getoor. Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2023.
Connor Pryor, Quan Yuan 0001, Jeremiah Z. Liu, Mehran Kazemi, Deepak Ramachandran, Tania Bedrax-Weiss, Lise Getoor
ACL (1)6
2021 Towards Question-Answering as an Automatic Metric for Evaluating the Content Quality of a Summary
abstract
Abstract A desirable property of a reference-based evaluation metric that measures the content quality of a summary is that it should estimate how much information that summary has in common with a reference. Traditional text overlap based metrics such as ROUGE fail to achieve this because they are limited to matching tokens, either lexically or via embeddings. In this work, we propose a metric to evaluate the content quality of a summary using question-answering (QA). QA-based methods directly measure a summary’s information overlap with a reference, making them fundamentally different than text overlap metrics. We demonstrate the experimental benefits of QA-based metrics through an analysis of our proposed metric, QAEval. QAEval outperforms current state-of-the-art metrics on most evaluations using benchmark datasets, while being competitive on others due to limitations of state-of-the-art models. Through a careful analysis of each component of QAEval, we identify its performance bottlenecks and estimate that its potential upper-bound performance surpasses all other automatic metrics, approaching that of the gold-standard Pyramid Method.1
Daniel Deutsch, Tania Bedrax-Weiss, Dan Roth 0001
Trans. Assoc. Comput. Linguistics2
2020 Simple and Principled Uncertainty Estimation with Deterministic Deep Learning via Distance Awareness
abstract
Bayesian neural networks (BNN) and deep ensembles are principled approaches to estimate the predictive uncertainty of a deep learning model. However their practicality in real-time, industrial-scale applications are limited due to their heavy memory and inference cost. This motivates us to study principled approaches to high-quality uncertainty estimation that require only a single deep neural network (DNN). By formalizing the uncertainty quantification as a minimax learning problem, we first identify input distance awareness, i.e., the model’s ability to quantify the distance of a testing example from the training data in the input space, as a necessary condition for a DNN to achieve high-quality (i.e., minimax optimal) uncertainty estimation. We then propose Spectral-normalized Neural Gaussian Process (SNGP), a simple method that improves the distance-awareness ability of modern DNNs, by adding a weight normalization step during training and replacing the output layer. On a suite of vision and language understanding tasks and on modern architectures (Wide-ResNet and BERT), SNGP is competitive with deep ensembles in prediction, calibration and out-of-domain detection, and outperforms the other single-model approaches.
Jeremiah Z. Liu, Zi Lin, Shreyas Padhy, Dustin Tran, Tania Bedrax-Weiss, Balaji Lakshminarayanan
NeurIPS5
2020 Faithful Embeddings for Knowledge Base Queries
abstract
The deductive closure of an ideal knowledge base (KB) contains exactly the logical queries that the KB can answer. However, in practice KBs are both incomplete and over-specified, failing to answer some queries that have real-world answers. \emph{Query embedding} (QE) techniques have been recently proposed where KB entities and KB queries are represented jointly in an embedding space, supporting relaxation and generalization in KB inference. However, experiments in this paper show that QE systems may disagree with deductive reasoning on answers that do not require generalization or relaxation. We address this problem with a novel QE method that is more faithful to deductive reasoning, and show that this leads to better performance on complex queries to incomplete KBs. Finally we show that inserting this new QE module into a neural question-answering system leads to substantial improvements over the state-of-the-art.
Haitian Sun, Andrew O. Arnold, Tania Bedrax-Weiss, Fernando Pereira 0003, William W. Cohen
NeurIPS3
2019 How Large Are Lions? Inducing Distributions over Quantitative Attributes
abstract
Most current NLP systems have little knowledge about quantitative attributes of objects and events.We propose an unsupervised method for collecting quantitative information from large amounts of web data, and use it to create a new, very large resource consisting of distributions over physical quantities associated with objects, adjectives, and verbs which we call Distribution over Quantities (DOQ) 1 .This contrasts with recent work in this area which has focused on making only relative comparisons such as "Is a lion bigger than a wolf?".Our evaluation shows that DOQ compares favorably with state of the art results on existing datasets for relative comparisons of nouns and adjectives, and on a new dataset we introduce.* Work carried out during an internship at Google.† Work carried out during employment at Google. 1 The resource is available at https:// github.com/google-research-datasets/ distribution-over-quantities
Yanai Elazar, Abhijit Mahabal, Deepak Ramachandran, Tania Bedrax-Weiss, Dan Roth 0001
ACL (1)4
2019 PullNet: Open Domain Question Answering with Iterative Retrieval on Knowledge Bases and Text
abstract
Haitian Sun, Tania Bedrax-Weiss, William Cohen. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). 2019.
Haitian Sun, Tania Bedrax-Weiss, William W. Cohen
EMNLP/IJCNLP (1)2
2004 PLASMA: A Constraint Based Planning Architecture
Andrew Bachmann, Tania Bedrax-Weiss, Jeremy Frank, Michael Iatauro, Conor McGann, Will Taylor
CP2