Search Results for author:
Found 13 papers, 5 papers with code
Online Restless Multi-Armed Bandits with Long-Term Fairness Constraints
Restless multi-armed bandits (RMAB) have been widely used to model sequential decision making problems with constraints.
KNN-LM Does Not Improve Open-ended Text Generation
Digging deeper, we find that interpolating with a retrieval distribution actually increases perplexity compared to a baseline Transformer LM for the majority of tokens in the WikiText-103 test set, even though the overall perplexity is lower due to a smaller number of tokens for which perplexity dramatically decreases after interpolation.
Measuring and Mitigating Constraint Violations of In-Context Learning for Utterance-to-API Semantic Parsing
In executable task-oriented semantic parsing, the system aims to translate users' utterances in natural language to machine-interpretable programs (API calls) that can be executed according to pre-defined API specifications.
You can't pick your neighbors, or can you? When and how to rely on retrieval in the $k$NN-LM
Retrieval-enhanced language models (LMs), which condition their predictions on text retrieved from large external datastores, have recently shown significant perplexity improvements compared to standard LMs.
Ranked #9 on
Language Modelling
on WikiText-103
Knowledge Injected Prompt Based Fine-tuning for Multi-label Few-shot ICD Coding
Automatic International Classification of Diseases (ICD) coding aims to assign multiple ICD codes to a medical note with average length of 3, 000+ tokens.
Ranked #1 on
Medical Code Prediction
on MIMIC-III
Modeling Exemplification in Long-form Question Answering via Retrieval
We show that not only do state-of-the-art LFQA models struggle to generate relevant examples, but also that standard evaluation metrics such as ROUGE are insufficient to judge exemplification quality.
Whittle Index based Q-Learning for Wireless Edge Caching with Linear Function Approximation
Using this structural result, we establish the indexability of our problem, and employ the Whittle index policy to minimize average latency.
Phrase-BERT: Improved Phrase Embeddings from BERT with an Application to Corpus Exploration
Phrase representations derived from BERT often do not exhibit complex phrasal compositionality, as the model relies instead on lexical similarity to determine semantic relatedness.
STORIUM: A Dataset and Evaluation Platform for Machine-in-the-Loop Story Generation
Systems for story generation are asked to produce plausible and enjoyable stories given an input context.
Achieving Adversarial Robustness via Sparsity
Through experiments on a variety of adversarial pruning methods, we find that weights sparsity will not hurt but improve robustness, where both weights inheritance from the lottery ticket and adversarial training improve model robustness in network pruning.
Parametric Bootstrap for Differentially Private Confidence Intervals
The goal of this paper is to develop a practical and general-purpose approach to construct confidence intervals for differentially private parametric estimation.
Online Algorithms for Multi-shop Ski Rental with Machine Learned Advice
We obtain both deterministic and randomized online algorithms with provably improved performance when either a single or multiple ML predictions are used to make decisions.
Casting Light on Invisible Cities: Computationally Engaging with Literary Criticism
Literary critics often attempt to uncover meaning in a single work of literature through careful reading and analysis.
