Study optimizes query strategy for private learning in eavesdropping scenarios.
problem Private sequential learning in the presence of eavesdropping.
method Developed new querying strategies and analytical techniques.
result Proved tight upper and lower bounds on optimal query complexity.
Proposes a max-utility arm selection strategy for reducing cumulative regret in sequential query recommendations.
problem Reduces cumulative regret in sequential query recommendations for closed loop interactive learning settings.
method Proposes a max-utility arm selection strategy based on the maximum utility of arms.
result Improves cumulative regret substantially compared to baseline algorithms and random selection.
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 active learning method for one-class classification using two classifiers.
problem Reducing manual labeling efforts in one-class classification.
method Uses two one-class classifiers for active learning, proposing new query strategies.
result Improved results compared to existing methods on various datasets.
Study exact community recovery in noisy SBM with limited queries.
problem Community recovery in noisy stochastic block models with limited queries.
method Balanced uniform querying, two-stage adaptive strategy, sublinear queries, subsampled graph.
result Adaptive querying can improve exact recovery limits in noisy SBM.
Survey on AL strategies for cost-effective annotation in classification.
problem Real-world AL challenges due to human annotators' limitations.
method Categorizes 60 real-world AL strategies considering multiple annotators, query types, and cost schemes.
result General real-world AL strategy introduced for categorization of 60 strategies.
Proposes a new OAL algorithm for imbalanced data with limited labels.
problem Handling imbalanced unlabeled datastream with limited query budget.
method Integrates asymmetric losses and queries strategies, uses second-order optimization, and applies sketching technique.
result Demonstrates improved performance and efficiency in class imbalance.
A new method for making interpretable predictions by sequentially asking questions, faster and more efficient.
problem Developing interpretable machine learning models for complex tasks.
method Variational Information Pursuit (V-IP) that bypasses the need for learning generative models.
result V-IP is 10-100x faster and finds shorter query chains compared to IP and reinforcement learning.
We study black-box attacks on machine learning classifiers where each query to the model incurs some cost or risk of detection to the adversary. We focus explicitly on minimizing the number of queries as a major objective. Specifically, we consider the problem of attacking machine learning classifiers subject to a budg…
The paper bridges theory and practice in query-driven selectivity learning.
problem Insufficient theoretical understanding of query-driven selectivity learning.
method Demonstrates learnability of selectivity predictors and establishes favorable OOD generalization error bounds.
result Theoretical advances improve OOD generalization of query-driven selectivity models.
Unified query framework for active metric learning and classification.
problem Combining representation learning and task-specific goals in machine learning.
method Adaptive selection of nearest neighbor queries using information theoretic criterion.
result Actively selected nearest neighbor queries outperform recent methods in deep metric learning and classification.
This paper proposes an active metric learning method for clustering with pairwise constraints.
problem Clustering with pairwise constraints and improving clustering performance.
method Active metric learning method that queries informative instance pairs and updates the learned metric sequentially.
result The proposed method enhances clustering performance and provides a tighter error bound.
We consider active learning of deep neural networks. Most active learning works in this context have focused on studying effective querying mechanisms and assumed that an appropriate network architecture is a priori known for the problem at hand. We challenge this assumption and propose a novel active strategy whereby …
We formulate a private learning model to study an intrinsic tradeoff between privacy and query complexity in sequential learning. Our model involves a learner who aims to determine a scalar value, v∗, by sequentially querying an external database and receiving binary responses. In the meantime, an adversary observes…
LLMs translate natural language trading intents into correct option strategies using a domain-specific language.
problem Challenges in translating natural language trading intents into correct option strategies due to the complexity of option chain data.
method Introduce Option Query Language (OQL) as a domain-specific intermediate representation to abstract option markets into high-level primitives under grammatical rules. Use LLMs as semantic parsers and validate queries by an engine.
result Significantly improves execution accuracy and logical consistency over direct baselines.
Two novel search strategies reduce complexity for target localization with size-dependent noise.
problem Target localization with varying measurement noise based on query region size.
method Proposes dyaPM and hiePM strategies with low complexity and connected query geometry. result Unified analysis shows dyaPM asymptotically optimal in search time, hiePM near-optimal in rate. C-IP improves LLMs' query selection for interactive tasks by estimating uncertainty robustly.
problem Minimizing the number of queries for interactive LLMs.
method Conformal Information Pursuit (C-IP) using conformal prediction sets.
result C-IP achieves better predictive performance and shorter query-answer chains.
Risk-aware active learning reduces generalization error.
problem Learning policies with minimal performance risk.
method Risk-aware active inverse reinforcement learning algorithm.
result Risk-aware active learning outperforms standard approaches.
Adaptive compute allocation improves model performance by prioritizing harder queries.
problem Inefficiency in allocating test-time compute uniformly across all queries.
method Formulated as a bandit learning problem, proposed adaptive algorithms that estimate query difficulty and allocate compute accordingly.
result Achieved up to 15.29% relative performance improvement on various benchmarks.
Unified study of active learning for deep neural networks.
problem Improving performance of deep neural networks through active learning.
method Investigation of incremental and cumulative training modes, model configurations, query strategies, and pseudo-labels.
result Proposed more efficient querying procedures and insights into active learning behavior.
Efficient black-box evasion attacks against deep networks with fewer queries.
problem Optimizing targeted evasion attacks with limited query budget.
method Formalized problem, evaluated benefits of using substitute models, presented two new attack strategies.
result Attack strategies are as effective as previous techniques but require significantly fewer queries.
Optimal query allocation improves extractive QA efficiency with LLMs.
problem Efficiency and reliability in extractive question answering with LLMs.
method Learning-to-Defer framework that allocates queries to specialized models.
result Enhanced answer reliability with reduced computational overhead.
CEGA addresses GNN security by enabling cost-effective model acquisition.
problem Vulnerability of Graph Neural Networks (GNNs) to model extraction attacks (MEAs).
method Proposes an adaptive node querying strategy to refine node selection over multiple learning cycles.
result Demonstrates superior performance in accuracy, fidelity, and F1 score under strict query-size constraints.
Meta-AAD uses deep reinforcement learning to improve anomaly detection by selecting the most informative instances.
problem High false-positive rate in anomaly detection, especially in high-stake applications.
method Meta-AAD leverages deep reinforcement learning to train a meta-policy for query selection, optimizing the number of discovered anomalies.
result Meta-AAD significantly outperforms state-of-the-art re-ranking strategies and unsupervised baselines on 24 benchmark datasets.
Optimizes state monitoring in Markovian systems with cost constraints.
problem Balancing state queries with prediction costs in Markovian systems.
method Greedy policy and SGD-based learning variant for optimal predict-query tradeoff.
result Greedy policy is suboptimal but performs close to optimal under certain conditions.
ActiveHNE improves HNE performance by using supervised information effectively.
problem Challenges in heterogeneous network embedding due to diverse node types and relationships.
method Develops ActiveHNE framework with DHNE and AQHN components, using graph convolutional neural network and multi-armed bandit mechanism.
result Demonstrates effectiveness and reduction in query cost compared to existing methods.
SEAL improves AL on attributed graphs by combining deep learning and adversarial strategies.
problem Efficient AL on attributed graphs with label sparsity issues.
method SEAL framework using adversarial components for graph embedding and semi-supervised discriminator.
result Superior performance improvements over state-of-the-art baselines.
Note that this paper is superceded by "Black-Box Adversarial Attacks with Limited Queries and Information." Current neural network-based image classifiers are susceptible to adversarial examples, even in the black-box setting, where the attacker is limited to query access without access to gradients. Previous methods -…
We propose a method to efficiently learn diverse strategies in reinforcement learning for query reformulation in the tasks of document retrieval and question answering. In the proposed framework an agent consists of multiple specialized sub-agents and a meta-agent that learns to aggregate the answers from sub-agents to…
Active learning has long been a topic of study in machine learning. However, as increasingly complex and opaque models have become standard practice, the process of active learning, too, has become more opaque. There has been little investigation into interpreting what specific trends and patterns an active learning st…
Establishes upper bounds on generalization error in active learning.
problem Improving query algorithms in active learning.
method Derives upper bounds on generalization error using informativeness and representativeness query strategies.
result Validates the use of regularization techniques to ensure bounds' validity.
Unified method for deep active learning improves performance and efficiency.
problem Improving deep active learning performance and efficiency.
method Unified and principled approach using Wasserstein distance for querying and training.
result Consistently better empirical performance and time-efficient query strategy compared to baselines.
sGPO optimizes RLVR training by balancing inference FLOPs and training efficiency.
problem RLVR training allocates rollout budget without considering query difficulty.
method sGPO trades inference FLOPs for reduced training FLOPs.
result sGPO matches or exceeds baseline performance while reducing training compute by a factor of three.
Graph embedding provides an efficient solution for graph analysis by converting the graph into a low-dimensional space which preserves the structure information. In contrast to the graph structure data, the i.i.d. node embedding can be processed efficiently in terms of both time and space. Current semi-supervised graph…
Budgeted deferral framework reduces expert query costs in machine learning.
problem High cost of querying all experts in deferral algorithms.
method Introduces budgeted deferral framework for selective expert querying.
result Empirical results show substantial reduction in training costs without sacrificing accuracy.
Active learning optimizes correlation clustering by querying the most informative pairwise comparisons.
problem Efficiently clustering data with limited pairwise similarity information.
method Developed principled active learning approach using information-theoretic acquisition functions.
result Significantly outperforms existing baselines in clustering accuracy and query efficiency.
A new search-control strategy improves Dyna's efficiency.
problem Improving sample efficiency in model-based reinforcement learning.
method Proposes a novel search-control strategy by sampling high frequency regions of the value function.
result Empirically shows that high frequency regions require more samples to approximate, suggesting a better search-control strategy.
Deep neural network (DNN) as a popular machine learning model is found to be vulnerable to adversarial attack. This attack constructs adversarial examples by adding small perturbations to the raw input, while appearing unmodified to human eyes but will be misclassified by a well-trained classifier. In this paper, we fo…
A simple patch copying method reduces black-box adversarial attack queries by 81%.
problem The effectiveness of black-box adversarial attacks depends on the initialization method.
method Copying small patches from other images as initialization points.
result Reduces the number of queries required for a state-of-the-art Boundary Attack by 81%
Active learning aims to obtain a classifier of high accuracy by using fewer label requests in comparison to passive learning by selecting effective queries. Many active learning methods have been developed in the past two decades, which sample queries based on informativeness or representativeness of unlabeled data poi…
This paper uses LLMs for causal discovery with active learning and dynamic scoring to improve efficiency and fairness.
problem High computational demands and complexities of large-scale data in causal discovery.
method Metadata-based approach, BFS strategy, Active Learning, Dynamic Scoring Mechanism, LLM confidence scores.
result Significantly reduced number of queries and improved efficiency in causal graph construction.
ProBO optimizes complex systems with flexible probabilistic models.
problem Optimizing expensive functions with minimal queries.
method Uses any probabilistic programming language to define models and optimize them.
result Demonstrates efficient optimization of complex models in BO.
A common problem in disciplines of applied Statistics research such as Astrostatistics is of estimating the posterior distribution of relevant parameters. Typically, the likelihoods for such models are computed via expensive experiments such as cosmological simulations of the universe. An urgent challenge in these rese…
Machine learning is being increasingly used by individuals, research institutions, and corporations. This has resulted in the surge of Machine Learning-as-a-Service (MLaaS) - cloud services that provide (a) tools and resources to learn the model, and (b) a user-friendly query interface to access the model. However, suc…
We propose a new active learning strategy designed for deep neural networks. The goal is to minimize the number of data annotation queried from an oracle during training. Previous active learning strategies scalable for deep networks were mostly based on uncertain sample selection. In this work, we focus on examples ly…
Wasserstein active regression improves estimation precision.
problem Improving regression model accuracy through active learning.
method Combines Wasserstein distance and GroupSort Neural Networks for uncertainty quantification.
result Wasserstein active regression often provides more precise estimations.
This paper improves retrieval for LLMs in financial document Q&A.
problem Suboptimal text chunk retrieval by RAG causes inaccuracies in LLM responses.
method Sophisticated chunking techniques, query expansion, metadata annotations, re-ranking algorithms, and embedding fine-tuning.
result Enhanced retrieval quality improves LLM performance and reliability.
Casting machine learning as a type of search, we demonstrate that the proportion of problems that are favorable for a fixed algorithm is strictly bounded, such that no single algorithm can perform well over a large fraction of them. Our results explain why we must either continue to develop new learning methods year af…