Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

97194290387 · Jun 202019922001200920172026
48 results for active experimentation

Bayesian adaptive designs can be biased by active learning, especially with misspecified models.

problem Active learning bias in Bayesian adaptive experimental designs.
method Analysis of linear and preference learning models, empirical testing.
result Model misspecification and noise influence active learning bias in Bayesian designs.

We consider active learning with logged data, where labeled examples are drawn conditioned on a predetermined logging policy, and the goal is to learn a classifier on the entire population, not just conditioned on the logging policy. Prior work addresses this problem either when only logged data is available, or purely…

2018-02-25abs ↗pdf ↗

Unified framework for hybrid learning and optimization via active inference.

problem Sequential decisions in black-box evaluations requiring both task improvement and uncertainty reduction.
method Pragmatic Curiosity (PraC) framework that evaluates queries by balancing information gain and pragmatic value.
result Unified approach reduces decision risk and improves coverage of critical regions without task-specific rules.

Active Learning (AL) methods seek to improve classifier performance when labels are expensive or scarce. We consider two central questions: Where does AL work? How much does it help? To address these questions, a comprehensive experimental simulation study of Active Learning is presented. We consider a variety of tasks…

2014-08-06abs ↗pdf ↗

Efficiently identifies key input variables for expensive functions using active learning.

problem Efficiently identify key input variables for expensive, black-box functions.
method Proposes novel active learning acquisition functions targeting derivative-based global sensitivity measures (DGSMs) under Gaussian process surrogate models.
result Active learning substantially enhances sample efficiency of DGSM estimation, especially with limited evaluation budgets.

New algorithm for adaptive experimental design in scientific settings.

problem Identifying true positives while controlling false discoveries in adaptive experimental design.
method Provably sample efficient adaptive algorithm for FDR control.
result First provably sample efficient adaptive algorithm for adaptive experimental design.

Optimizes sampling for faster convergence in Bayesian experimental design and uncertainty quantification.

problem Efficiently selecting samples for faster convergence in Bayesian experimental design and uncertainty quantification.
method Output-weighted acquisition functions leveraging likelihood ratio to guide sampling towards relevant regions.
result Superiority of the proposed method in uncertainty quantification and rare event identification.

New method for selecting data points in deep learning models.

problem Selecting data points for overparameterized deep learning models.
method Proposes a new experimental design strategy for overparameterized regression and interpolation.
result Demonstrates the effectiveness of the new method in single shot deep active learning.

A new experimental design method for combinatorial interventions reduces complexity and improves accuracy.

problem Efficiently conducting all possible combinatorial interventions with multiple treatments and potential interactions.
method Probabilistic factorial experimental design, applying random combinations of treatments and adapting over multiple rounds.
result Optimal dosage of 1/2 for each treatment yields near-optimal design for estimating any k-way interaction model.

Bayesian nonparametric model predicts user activity and intervention success.

problem Predicting user activity and intervention success in online experiments.
method Bayesian nonparametric approach to model user heterogeneity and derive user activity predictions.
result The proposed method outperforms existing approaches in predicting user activity and intervention success.

Active learning is an important technique to reduce the number of labeled examples in supervised learning. Active learning for binary classification has been well addressed in machine learning. However, active learning of the reject option classifier remains unaddressed. In this paper, we propose novel algorithms for a…

2019-06-14abs ↗pdf ↗

Traditionally, the automatic recognition of human activities is performed with supervised learning algorithms on limited sets of specific activities. This work proposes to recognize recurrent activity patterns, called routines, instead of precisely defined activities. The modeling of routines is defined as a metric lea…

2019-07-08abs ↗pdf ↗

Active inference selects actions to maximize information gain, aiding structure learning.

problem Learning the structure of underlying world models.
method Active inference selects actions based on expected free energy, which includes information gain and value.
result Actions that maximize information gain help disambiguate among alternative models.

ALMAB-DC optimizes expensive black-box experiments using active learning and distributed computing.

problem Efficiently optimizing expensive, gradient-free objectives in computational statistics and machine learning.
method Combines active learning, multi-armed bandits, and distributed asynchronous computing.
result Achieves lower simple regret and superior performance in various tasks compared to non-ALMAB baselines.

ALINE optimizes Bayesian inference and data acquisition by strategically querying informative data.

problem Strategic acquisition of informative data for Bayesian inference in challenging tasks.
method Unified framework combining amortized Bayesian inference and active data acquisition using a transformer architecture trained via reinforcement learning.
result ALINE delivers both instant and accurate inference along with efficient selection of informative points.

Proposes a graph-based method for active learning in regression.

problem Active learning for regression is understudied and faces challenges with noisy labels and parameter uncertainty.
method Formulates active regression as a bipartite graph optimization problem.
result Demonstrates the effectiveness of the proposed graph-based approach on benchmark data sets.

DABS uses a policy network to select experiments in high-dimensional design spaces.

problem Adaptive factorial screening in high-dimensional discrete design spaces.
method DABS learns a policy network offline to sequentially select experiments, incorporating sparsity and interactions via a spike-and-slab prior.
result DABS achieves superior accuracy and scalability over classical and Bayesian baselines under tight experimental budgets.

We develop a new active learning algorithm for the streaming setting satisfying three important properties: 1) It provably works for any classifier representation and classification problem including those with severe noise. 2) It is efficiently implementable with an ERM oracle. 3) It is more aggressive than all previo…

2015-06-29abs ↗pdf ↗

BinaryDuo improves BNNs by coupling binary activations, outperforming state-of-the-art models.

problem Gradient mismatch in BNNs due to binarizing activations.
method Using gradient of smoothed loss function to estimate gradient mismatch, proposing BinaryDuo scheme with coupled ternary activations.
result BinaryDuo outperforms state-of-the-art BNNs on various benchmarks.

New algorithm improves active learning in agnostic pool-based classification.

problem Efficient active learning in the agnostic setting with minimized sample complexity.
method Solves an experimental design problem to determine a distribution over examples for label requests.
result Achieves sample complexity bounds never worse than best disagreement coefficient-based bounds, sometimes significantly smaller.

In training speech recognition systems, labeling audio clips can be expensive, and not all data is equally valuable. Active learning aims to label only the most informative samples to reduce cost. For speech recognition, confidence scores and other likelihood-based active learning methods have been shown to be effectiv…

2016-12-10abs ↗pdf ↗

The effectiveness of deep neural architectures has been widely supported in terms of both experimental and foundational principles. There is also clear evidence that the activation function (e.g. the rectifier and the LSTM units) plays a crucial role in the complexity of learning. Based on this remark, this paper discu…

2018-07-17abs ↗pdf ↗

We propose a novel active learning framework for activity recognition using wearable sensors. Our work is unique in that it takes physical and cognitive limitations of the oracle into account when selecting sensor data to be annotated by the oracle. Our approach is inspired by human-beings' limited capacity to respond …

2019-07-28abs ↗pdf ↗

Identifies learning rules from neural network observables.

problem Determine the underlying plasticity rules governing learning in biological systems.
method Simulated idealized neuroscience experiments with artificial neural networks to generate a dataset of learning trajectories. Used linear and non-linear classifiers to identify learning rules from aggregate statistics of weights, activations, and activity changes.
result Different classes of learning rules can be separated solely on the basis of aggregate statistics of the weights, activations, or instantaneous layer-wise activity changes.

AL methods show inconsistent performance gains over random sampling, highlighting variability in neural network-based approaches.

problem Inconsistent performance of AL methods using neural networks.
method Different types of AL algorithms (uncertainty based, diversity based, and committee based) were tested under identical experimental settings.
result AL methods do not consistently outperform random sampling, revealing variability in performance metrics.

LCW reduces activation shift in neural networks, improving training efficiency and generalization.

problem Activation shift in neural networks leading to non-zero mean preactivation values.
method Linearly constrained weights (LCW) to reduce activation shift in fully connected and convolutional layers.
result LCW resolves the vanishing gradient problem and improves generalization of neural networks.

New active learning methods for Gaussian process improve predictive modeling of composite fuselage.

problem Improving predictive modeling of composite fuselage with limited training samples and uncertainties.
method Proposed two new active learning algorithms for Gaussian process considering uncertainties.
result The proposed approach realizes better prediction performance for automatic shape control of composite fuselage.

New method predicts activity coefficients for binary mixtures without using physical descriptors.

problem Predicting activity coefficients for unexplored binary mixtures.
method Probabilistic matrix factorization model.
result Method outperforms state-of-the-art models requiring less training effort.

Data generation and labeling are usually an expensive part of learning for robotics. While active learning methods are commonly used to tackle the former problem, preference-based learning is a concept that attempts to solve the latter by querying users with preference questions. In this paper, we will develop a new al…

2018-10-10abs ↗pdf ↗