Algorithm improves query recommendations with immediate user feedback.
problem Lack of adaptability to immediate user feedback in query recommendation algorithms.
method Augmented transformer-based causal language models with multi-armed bandit framework.
result Substantial improvement in per-round regret compared to state-of-the-art models.
Proposes a new query autocompletion method that maximizes retrieval performance.
problem Users often select suboptimal queries due to unknown best retrieval performance.
method Formulates query autocompletion as ranking item rankings, uses counterfactual learning.
result Empirical results show improved query suggestions for better retrieval performance.
Interactive learning explained to users improves trust and model understanding.
problem Lack of user understanding and trust in interactive learning models.
method Proposes a framework where learners explain interactive queries and predictions to users, using visual explanations.
result Boosts predictive and explanatory powers of and user trust in learned models.
User-specific KWS system learns new keywords on-device.
problem Out-of-vocabulary problem in traditional KWS systems.
method Query-by-example enrollment and testing, using phonetic posteriors and FST.
result Promising performance on two keywords, preserving simplicity.
Projective preferential Bayesian optimization learns user preferences in high dimensions.
problem Finding extrema of a black-box function in high-dimensional spaces.
method Projective preferential queries for feedback in human-interaction.
result Framework finds global minimum of high-dimensional black-box function.
Algorithm learns diverse rankings for search engines.
problem Designing algorithms for search engines to rank diverse items.
method LDR (Learning Diverse Rankings) algorithm, efficient learning based on users' feedback.
result Algorithm achieves optimal ranking performance with O((N−L)log(T)) regret. Adaptive querying learns user psychometrics with AI personas.
problem Learning user psychometrics within query budgets.
method Persona-induced latent variable model with AI personas and large language model response distributions.
result Persona-based posteriors deliver accurate probabilistic predictions.
Active Inverse Reward Design improves AI agent training by querying users for reward function preferences.
problem Iterative reward function tuning in AI agents is inefficient and may not generalize well.
method Structured queries to the user to compare reward functions, updating posterior with IRD.
result Substantially outperforms IRD in test environments, inferring non-linear rewards.
DONUT spots custom wakewords from voice recordings.
problem Spotting personalized wakewords for hands-free devices.
method CTC-based algorithm using training examples and hypothesis aggregation.
result DONUT enables custom wakewords without private data upload.
Efficiently learns reward functions with few user queries.
problem Efficiently learning reward functions with minimal data and user interaction.
method Batch active preference-based learning algorithm.
result The algorithm requires only a few queries and short computation times.
We live in a computerized and networked society where many of our actions leave a digital trace and affect other people's actions. This has lead to the emergence of a new data-driven research field: mathematical methods of computer science, statistical physics and sociometry provide insights on a wide range of discipli…
COBRAS uses super-instances to quickly cluster data with user queries.
problem Clustering data with user-defined pairwise constraints efficiently.
method Top-down construction of super-instances, iterative refinement based on user queries.
result COBRAS produces high-quality clusterings at fast run times.
DeepProbe uses seq2seq models to improve query understanding and chatbot design.
problem Improving query understanding and chatbot design efficiency.
method Attention-based seq2seq recurrent neural network for information extraction and active user interactions.
result DeepProbe achieves significant improvements in query understanding and chatbot efficiency.
Personalizes query completion in digital commerce with image-based vectors.
problem High bounce rate and low recurring users in query completion.
method Injects dense vectors from product images into a noisy channel model.
result Image-based personalization improves query completion and user experience.
Interactive image retrieval system learns from user feedback and unlabeled data.
problem Efficiently retrieve relevant images with minimal user interaction.
method Combines active learning and graph-based semi-supervised learning (GSSL) to use unlabeled data.
result High F1 scores with few relevance feedback rounds on large datasets.
Proposes a new model to capture joint influence of correlated events on user search behavior.
problem Real-world events influence each other and pose joint influence on user search behavior, not independent.
method Joint Influence Model based on Multivariate Hawkes Process.
result The model captures the temporal dynamics of joint influence and outperforms baseline methods.
Improves text-to-SQL models by selecting the best SQL query from beam output.
problem Simplifying database query writing for natural language questions.
method Discriminative re-ranker using BERT fine-tuned classifier.
result Achieved top 4 score on Spider leaderboard.
Optimal policy reduces entropy in preference learning.
problem Learning user preferences via choice-based queries.
method Parametric model with Bayesian prior, greedy policy for entropy reduction.
result Greedy policy achieves linear lower bound on entropy reduction.
System identifies and responds to help queries in personal assistants.
problem Difficulty in remembering command structures for various tasks in personal assistants.
method Proposes a C-BiLSTM based classifier and semantic ANN module to detect and respond to help queries.
result System outperforms other approaches in returning relevant responses for help queries.
The paper introduces subgraph nomination for finding similar subgraphs in networks.
problem Finding similar subgraphs in networks using example subgraphs.
method Formalizes subgraph nomination framework with user-supervised retrieval.
result User-supervised retrieval improves performance in subgraph nomination.
Study active learning for multi-level user preferences in recommendation systems.
problem Efficiently learning user preferences through active querying in recommendation systems.
method Proposes a theoretically optimal active learning strategy based on Fisher information matrix for collective matrix factorization.
result Demonstrates strong improvements over active learning methods in personalized, cold-start, and noisy data settings.
Paper builds LETOR models for e-commerce, segmenting queries and optimizing search results.
problem Optimizing search results for e-commerce platforms.
method Segmenting queries into broad and narrow, using denoising auto-encoders and skip-gram embeddings, employing various feature types.
result Specialized models for broad and narrow queries outperform a combined model.
Meta-ensemble scheme allocates queries to EC nodes for reduced latency.
problem Efficiently allocating queries to EC nodes to minimize latency.
method Combining ensemble models to decide query allocation based on node and query characteristics.
result Meta-ensemble scheme outperforms traditional allocation methods in reducing query processing latency.
Efficiently learns reward functions with fewer queries and shorter computation times.
problem Expensive data generation and labeling in robot learning.
method Batch active preference-based learning methods using determinantal point processes (DPP) and heuristic alternatives.
result Our batch active learning algorithm requires only a few queries and computes them in a short amount of time.
Estimates user preferences from noisy paired comparisons.
problem Estimating user preferences from noisy paired comparisons.
method Greedy information maximization strategies.
result Superior preference estimation over state-of-the-art methods.
mp-LSH shares hash codes for multiple dissimilarities.
problem Hash codes depend on dissimilarity, limiting query-time adjustments.
method mp-LSH shares hash codes for L2, cosine, inner product, and weighted sums.
result mp-LSH supports user-adjustable weights and feature importance.
Popular online enrichment analysis tools from the field of molecular systems biology provide users with the ability to submit their experimental results as gene sets for individual analysis. Such queries are kept private, and have never before been considered as a resource for integrative analysis. By harnessing gene s…
Algorithm learns user's reward function from hypothetical behaviors.
problem Aligning agent behavior with unknown user objectives.
method Synthesizes hypothetical behaviors, asks user for rewards, trains neural network.
result Significantly outperforms prior methods in learning reward models.
A new method for recommending groups and activities based on geo-social data.
problem Recommendation of groups and activities based on geo-social data with social constraints.
method Proposes an attentive geo-social group recommendation method with an attention mechanism and a spatial query algorithm.
result Significantly outperforms baseline methods in real-world datasets.
Collaborative filtering (CF) allows the preferences of multiple users to be pooled to make recommendations regarding unseen products. We consider in this paper the problem of online and interactive CF: given the current ratings associated with a user, what queries (new ratings) would most improve the quality of the rec…
Improved privacy for heavy-hitters detection.
problem Private detection of heavy-hitters in dynamic data.
method New algorithm for privately identifying heavy-hitters.
result Improved error guarantees over existing techniques.
Improves model classification accuracy in black-box settings.
problem Difficulty in inferring model properties due to limited query access.
method Introduces discriminative factorization to distinguish high-quality queries.
result Probability of chance-level classification decreases exponentially with query budget.
Distributions over rankings are used to model data in various settings such as preference analysis and political elections. The factorial size of the space of rankings, however, typically forces one to make structural assumptions, such as smoothness, sparsity, or probabilistic independence about these underlying distri…
Solves TOD systems' query annotation problem without explicit annotations.
problem Training TOD systems without explicit KB query annotation.
method Reinforcement learning (RL) and pipelined approach for query prediction and system training.
result Improved RL agent with modifications for TOD tasks.
Visual reranking is effective to improve the performance of the text-based video search. However, existing reranking algorithms can only achieve limited improvement because of the well-known semantic gap between low level visual features and high level semantic concepts. In this paper, we adopt interactive video search…
New framework for efficient query-based imitation learning.
problem Aligning agent policy with human expert behavior without prior knowledge.
method Adversarial reward query with successor representation.
result Significantly outperforms uncertainty-based methods in query efficiency.
Adapts large transformer model for search query intent understanding.
problem Understanding and predicting user intents from search queries.
method Adapts BERT-like architecture for search queries, accounts for query noisiness and sparseness.
result Builds a shareable deep learning model for query intent identification.
In query learning, the goal is to identify an unknown object while minimizing the number of "yes or no" questions (queries) posed about that object. We consider three extensions of this fundamental problem that are motivated by practical considerations in real-world, time-critical identification tasks such as emergency…
Federated learning improves keyboard suggestions without user data.
problem Improving search suggestion quality without direct user data access.
method Applied federated learning for global-scale model training and deployment.
result Significant quality increases in search suggestions.
FinBloom enhances LLMs for real-time financial queries.
problem Limited access to real-time financial data by LLMs.
method Developed a custom 7B parameter LLM, Financial Context Dataset, and a Financial Agent.
result Significantly improved LLMs' capability to handle dynamic financial tasks.
Paper develops active learning for clustering unknown pairwise similarities.
problem Learning positive and negative pairwise similarities efficiently.
method Generic active learning framework for correlation clustering.
result Demonstrates effectiveness of query strategies in clustering.
A new framework promotes trustworthy user-generated datasets by ensuring no user benefits from misreporting.
problem Incentivizing data misreporting in user-generated datasets.
method Proposes Licchavi, a global and personalized learning framework with provable strategyproofness guarantees.
result Proves that no user can gain much by replying to Licchavi's queries with deviated answers.
PriceAggregator optimizes hotel price fetching to increase Agoda's bookings.
problem Limited QPS from suppliers causes many user searches to be ignored.
method Intelligently determines queries to suppliers for price fetching.
result PriceAggregator increases Agoda's bookings significantly.
We model GitHub interactions as a temporal knowledge graph for software engineering questions.
problem Insufficient performance of existing temporal models on extrapolated queries and time prediction.
method Introduced an extension to current temporal models using relative temporal information.
result Improved performance on extrapolated queries and time prediction.
Max-margin method for eliciting preferences in large spaces.
problem Preference elicitation in large configuration spaces.
method Setwise max-margin learning as a generalization of max-margin learning to sets.
result Produces diverse sets of items for user queries and encourages sparsity.
Model extraction attacks exploit MLaaS query interfaces to steal models.
problem Model extraction attacks compromise MLaaS systems by stealing models through query interfaces.
method Formalized model extraction, compared it to active learning, and investigated defense strategies.
result Recent active learning advancements can be used to implement powerful model extraction attacks.
LLM4Causal democratizes causal reasoning via fine-tuned LLMs.
problem Limited capability of LLMs in causal inference and interpretation.
method Fine-tuning an open-source LLM for causal tasks, proposing datasets for instruction tuning.
result LLM4Causal delivers end-to-end solutions for causal problems and interprets results easily.
DoWhy-GCM extends causal inference in graphical models for diverse queries.
problem Addressing diverse causal queries in graphical causal models.
method Specify cause-effect relations via a causal graph, fit causal mechanisms, pose causal queries.
result Identification of root causes, attribution of causal influences, diagnosis of causal structures.