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,695 papers · 148 categories

Trend · papers per month

216432648864 · Jun 202019922001200920172026
48 results for active importance sampling

We study the problem of training machine learning models incrementally with batches of samples annotated with noisy oracles. We select each batch of samples that are important and also diverse via clustering and importance sampling. More importantly, we incorporate model uncertainty into the sampling probability to com…

2019-09-27abs ↗pdf ↗

We consider an active learning setting where the algorithm has access to a large pool of unlabeled data and a small pool of labeled data. In each iteration, the algorithm chooses few unlabeled data points and obtains their labels from an oracle. In this paper, we consider a probabilistic querying procedure to choose th…

2019-10-10abs ↗pdf ↗

New method uses active importance sampling for rare event optimization in high-dimensional problems.

problem Optimizing complex, high-dimensional functions with rare events.
method Combines rare events sampling with neural network optimization.
result Importance sampling reduces asymptotic variance, improving generalization.

Active learning method optimizes seismic fragility curve estimation.

problem Optimizing calls to complex numerical models for fragility curve estimation.
method Importance sampling based active learning for parametric seismic fragility curve estimation.
result The method optimizes the estimation of fragility curves with mathematical rigor.

Active testing reduces label costs for efficient model evaluation.

problem Real-world applications require expensive test labels, disconnecting from existing model evaluation methods.
method Derives acquisition strategies to select test points efficiently, addressing label bias and variance.
result Active testing improves model evaluation efficiency without sacrificing accuracy.

Low bit-width integer weights and activations are very important for efficient inference, especially with respect to lower power consumption. We propose Monte Carlo methods to quantize the weights and activations of pre-trained neural networks without any re-training. By performing importance sampling we obtain quantiz…

2019-05-29abs ↗pdf ↗

Active learning methods, like uncertainty sampling, combined with probabilistic prediction techniques have achieved success in various problems like image classification and text classification. For more complex multivariate prediction tasks, the relationships between labels play an important role in designing structur…

2019-12-29abs ↗pdf ↗

In the world of big data, large but costly to label datasets dominate many fields. Active learning, a semi-supervised alternative to the standard PAC-learning model, was introduced to explore whether adaptive labeling could learn concepts with exponentially fewer labeled samples. While previous results show that active…

2019-07-08abs ↗pdf ↗

New method identifies wrongly predicted samples for active learning.

problem Identifying important samples for machine learning models.
method A sample selection criterion based on model prediction and its effect on generalization error.
result State-of-the-art results and better rates at identifying wrongly predicted samples.

Random Forest variable importance is improved by class balancing techniques.

problem Class imbalance problem in machine learning.
method Proposed a variable selection algorithm using RF variable importance and its confidence interval.
result Our algorithm efficiently selects an optimal feature set, leading to improved prediction performance.

Deep learning models have demonstrated outstanding performance in several problems, but their training process tends to require immense amounts of computational and human resources for training and labeling, constraining the types of problems that can be tackled. Therefore, the design of effective training methods that…

2019-04-26abs ↗pdf ↗

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.

Method quantifies sensitivity of reliability analysis to uncertainty sources.

problem Computational expense in reliability analysis of complex models.
method Gaussian process surrogate model, active learning, sensitivity analysis.
result Reduces main source of error in estimating rare event probabilities.

This paper improves SNN training by using multiple sample compartments.

problem Training SNNs with single-sample estimators leads to inaccurate log-likelihood estimates.
method Proposes a GEM-based online learning algorithm that uses multiple independent spiking signals.
result Significant improvements in log-likelihood, accuracy, and calibration with multiple compartments.

IMPACT optimizes LLM compression by focusing on activation importance, reducing model size up to 55.4%.

problem Resource constraints in deploying large language models (LLMs).
method IMPACT integrates activation importance into low-rank compression, optimizing for both size and accuracy.
result IMPACT achieves up to 55.4% greater model size reduction while maintaining comparable or better accuracy.

Parallelizes active learning for Bayesian inference using Nested Sampler.

problem Expensive likelihood evaluations in complex experiments.
method Uses Nested Sampler to generate nearly-optimal batches of candidates in parallel.
result Comparable accuracy to sequential conditioning with efficient parallelization.

Reinforcement learning has attracted great attention recently, especially policy gradient algorithms, which have been demonstrated on challenging decision making and control tasks. In this paper, we propose an active multi-step TD algorithm with adaptive stepsizes to learn actor and critic. Specifically, our model cons…

2019-11-11abs ↗pdf ↗

New methods improve Bayesian inference and decision-making in online learning.

problem Current Bayesian deep learning does not fully utilize joint predictives for sequential decision-making.
method Proposes new evaluation settings for active learning and active sampling, focusing on marginal and joint cross-entropies.
result Initial experiments suggest challenges in applying current BDL inference techniques in high-dimensional spaces.

In this paper, we make an important step towards the black-box machine teaching by considering the cross-space machine teaching, where the teacher and the learner use different feature representations and the teacher can not fully observe the learner's model. In such scenario, we study how the teacher is still able to …

2017-10-21abs ↗pdf ↗

ActiveCQ improves causal quantity estimation with active learning and Gaussian Processes.

problem Estimating causal quantities requires large datasets, which are costly.
method Unified framework using Gaussian Processes and conditional mean embeddings for distribution estimation. Derived principled acquisition strategies based on information gain and total variance reduction.
result Framework significantly outperforms baselines in sample efficiency across various causal quantities.

We investigate active learning by pairwise similarity over the leaves of trees originating from hierarchical clustering procedures. In the realizable setting, we provide a full characterization of the number of queries needed to achieve perfect reconstruction of the tree cut. In the non-realizable setting, we rely on k…

2019-06-22abs ↗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.

SCoreBO improves Bayesian optimization by learning hyperparameters and self-correcting.

problem Efficient hyperparameter tuning for Gaussian process models in Bayesian optimization.
method Introduces SAL and SCoreBO, which prioritize hyperparameter learning and perform simultaneous optimization and learning.
result SCoreBO outperforms state-of-the-art methods on traditional benchmarks and atypical tasks.

We consider the problem of learning classifiers for labeled data that has been distributed across several nodes. Our goal is to find a single classifier, with small approximation error, across all datasets while minimizing the communication between nodes. This setting models real-world communication bottlenecks in the …

2012-02-27abs ↗pdf ↗

Adaptive quadrature improves Bayesian inference through active learning.

problem Efficiently estimating posterior densities in Bayesian inference.
method Sequential node selection using acquisition functions, combining interpolative surrogate models and quadrature rules.
result Positive estimation of marginal likelihood with improved accuracy.

Normalization techniques play an important role in supporting efficient and often more effective training of deep neural networks. While conventional methods explicitly normalize the activations, we suggest to add a loss term instead. This new loss term encourages the variance of the activations to be stable and not va…

2018-11-21abs ↗pdf ↗

Human activity recognition plays an important role in people's daily life. However, it is often expensive and time-consuming to acquire sufficient labeled activity data. To solve this problem, transfer learning leverages the labeled samples from the source domain to annotate the target domain which has few or none labe…

2018-07-20abs ↗pdf ↗

Efficiently identifies good policies by choosing contexts for human feedback.

problem Efficiently acquiring human feedback for preference alignment in large language models.
method Formalizes active exploration as a dueling bandit problem and proposes an active exploration algorithm with a polynomial worst-case regret bound.
result Proposed method outperforms baselines with limited human preferences on various language models and datasets.

This paper studies activation sparsity in large language models, finding key trends and implications.

problem Activation sparsity in large language models (LLMs) can be improved for efficiency and interpretability.
method Proposes PPL-p%p\% sparsity, analyzes trends with training data, width-depth ratio, and parameter scale.
result ReLU is more efficient for sparsity than SiLU, and deeper architectures can improve sparsity.

In critical applications of anomaly detection including computer security and fraud prevention, the anomaly detector must be configurable by the analyst to minimize the effort on false positives. One important way to configure the anomaly detector is by providing true labels for a few instances. We study the problem of…

2018-09-17abs ↗pdf ↗

Bayesian learning of model parameters in neural networks is important in scenarios where estimates with well-calibrated uncertainty are important. In this paper, we propose Bayesian quantized networks (BQNs), quantized neural networks (QNNs) for which we learn a posterior distribution over their discrete parameters. We…

2019-12-06abs ↗pdf ↗

New method improves active statistical inference by reducing noise.

problem Inaccurate uncertainty estimates in active sampling lead to noisy results.
method Robust sampling strategies that interpolate between uniform and active sampling based on uncertainty scores.
result The robust sampling ensures that the estimator is never worse than uniform sampling and usually outperforms active inference.