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

Anton Bakalov

dblp:44/321 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 5 · 1 since 2021Databases, data management, data science and information retrieval · 4 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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
Vision and language · 42% Efficient and distributed learning · 37% Speech recognition and synthesis · 21%
Databases, data mining, and information retrieval
2 papers
Information retrieval · 83% Data integration and cleaning · 17%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › Vision and language › vision-language model
prompt learning
0.712023
Promptagator: Few-shot Dense Retrieval From 8 Examples · ICLR 2023
Information retrieval › retrieval models › neural retrieval
dense retrieval
0.712023
Promptagator: Few-shot Dense Retrieval From 8 Examples · ICLR 2023
Natural language and speech › Speech recognition and synthesis › speech analysis
language identification
0.312018
A Fast, Compact, Accurate Model for Language Identification of Codemixed Text · EMNLP 2018
Machine learning › Efficient and distributed learning › model compression
efficient architecture design
0.312017
Natural Language Processing with Small Feed-Forward Networks · EMNLP 2017
Machine learning › Efficient and distributed learning
model compression
0.312017
Natural Language Processing with Small Feed-Forward Networks · EMNLP 2017
Information retrieval › search interfaces
search result presentation
0.112011
SCAD: collective discovery of attribute values · WWW 2011
Data integration and cleaning › data extraction
structured data extraction
0.112011
SCAD: collective discovery of attribute values · WWW 2011

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

prompt generation · 1.3dense retrieval · 1.3globally constrained decoder · 0.3feed-forward network · 0.3feedforward neural network · 0.3web mining · 0.1crowdsourcing · 0.1
YearPublicationVenuePosition
2023 Promptagator: Few-shot Dense Retrieval From 8 Examples
Zhuyun Dai, Vincent Y. Zhao, Ji Ma 0004, Yi Luan, Jianmo Ni, Jing Lu 0014, Anton Bakalov, Kelvin Guu, Keith B. Hall, Ming-Wei Chang
ICLR7
2018 A Fast, Compact, Accurate Model for Language Identification of Codemixed Text
abstract
We address fine-grained multilingual language identification: providing a language code for every token in a sentence, including codemixed text containing multiple languages.Such text is prevalent online, in documents, social media, and message boards.We show that a feed-forward network with a simple globally constrained decoder can accurately and rapidly label both codemixed and monolingual text in 100 languages and 100 language pairs.This model outperforms previously published multilingual approaches in terms of both accuracy and speed, yielding an 800x speed-up and a 19.5% averaged absolute gain on three codemixed datasets.It furthermore outperforms several benchmark systems on monolingual language identification.
Yuan Zhang 0001, Jason Riesa, Daniel Gillick, Anton Bakalov, Jason Baldridge, David Weiss 0001
EMNLP4
2017 Natural Language Processing with Small Feed-Forward Networks
abstract
We show that small and shallow feedforward neural networks can achieve near state-of-the-art results on a range of unstructured and structured language processing tasks while being considerably cheaper in memory and computational requirements than deep recurrent models.Motivated by resource-constrained environments like mobile phones, we showcase simple techniques for obtaining such small neural network models, and investigate different tradeoffs when deciding how to allocate a small memory budget.
Jan A. Botha, Emily Pitler, Ji Ma 0004, Anton Bakalov, Alex Salcianu, David Weiss 0001, Ryan T. McDonald, Slav Petrov
EMNLP4
2011 Evaluating an associative browsing model for personal information
abstract
Recent studies suggest that associative browsing can be beneficial for personal information access. Associative browsing is intuitive for the user and complements other methods of accessing personal information, such as keyword search. In our previous work, we proposed an associative browsing model of personal information in which users can navigate through the space of documents and concepts (e.g., person names, events, etc.). Our approach differs from other systems in that it presented a ranked list of associations by combining multiple measures of similarity, whose weights are improved based on click feedback from the user.
Jin Young Kim 0005, W. Bruce Croft, David A. Smith, Anton Bakalov
CIKM4
2011 SCAD: collective discovery of attribute values
abstract
Search engines today offer a rich user experience, no longer restricted to "ten blue links". For example, the query "Canon EOS Digital Camera" returns a photo of the digital camera, and a list of suitable merchants and prices. Similar results are offered in other domains like food, entertainment, travel, etc. All these experiences are fueled by the availability of structured data about the entities of interest.
Anton Bakalov, Ariel Fuxman, Partha P. Talukdar, Soumen Chakrabarti
WWW1
2010 Building a semantic representation for personal information
abstract
A typical collection of personal information contains many documents and mentions many concepts (e.g., person names, events, etc.). In this environment, associative browsing between these concepts and documents can be useful as a complement for search. Previous approaches in the area of semantic desktops aimed at addressing this task. However, they were not practical because they require tedious manual annotation by the user.
Jin Young Kim 0005, Anton Bakalov, David A. Smith, W. Bruce Croft
CIKM2
2009 "They Are Out There, If You Know Where to Look": Mining Transliterations of OOV Query Terms for Cross-Language Information Retrieval
Raghavendra Udupa, K. Saravanan 0001, Anton Bakalov, Abhijit Bhole
ECIR3