Modern computing and communication technologies can make data collection procedures very efficient. However, our ability to analyze large data sets and/or to extract information out from them is hard-pressed to keep up with our capacities for data collection. Among these huge data sets, some of them are not collected f…
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
48 results for “active set procedure”
We study a logistic model-based active learning procedure for binary classification problems, in which we adopt a batch subject selection strategy with a modified sequential experimental design method. Moreover, accompanying the proposed subject selection scheme, we simultaneously conduct a greedy variable selection pr…
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…
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…
Sparse Canonical Correlation Analysis (CCA) has received considerable attention in high-dimensional data analysis to study the relationship between two sets of random variables. However, there has been remarkably little theoretical statistical foundation on sparse CCA in high-dimensional settings despite active methodo…
Consider a set of latent factors whose observable effect of activation is caught on a measure space that appears as a grid of bits tacking value in . This paper intend to deliver a theoretical and practical answer to the question: Given that we have access to a perfect indicator of the activation of latent f…
We propose an active set selection framework for Gaussian process classification for cases when the dataset is large enough to render its inference prohibitive. Our scheme consists of a two step alternating procedure of active set update rules and hyperparameter optimization based upon marginal likelihood maximization.…
Extends active subspace analysis to infinite dimensions.
problem Dimension reduction in infinite dimensional functionals.
method Defines an operator for Hilbert space, extends Euclidean properties, proposes Monte Carlo procedure.
result Desirable properties extend to infinite dimensional setting.
Method identifies cardiac ectopic activity sites from 12-lead ECG.
problem Locate dangerous ectopic activation sites in the heart.
method Bayesian optimization on cardiac model and ECG data.
result Method converges to minimum after 11.7-3.5 iterations.
This work presents an explicit-implicit procedure to compute a model predictive control (MPC) law with guarantees on recursive feasibility and asymptotic stability. The approach combines an offline-trained fully-connected neural network with an online primal active set solver. The neural network provides a control inpu…
We study the localization of a cluster of activated vertices in a graph, from adaptively designed compressive measurements. We propose a hierarchical partitioning of the graph that groups the activated vertices into few partitions, so that a top-down sensing procedure can identify these partitions, and hence the activa…
Procedure removes training data dependency from deep networks, improving generalization.
problem Removing dependency on training data in deep networks for better generalization.
method Deterministic and stochastic parts to ensure forgetting, leveraging activation and weight dynamics.
result New bound on information extraction from black-box networks, ensuring forgetting in activations.
Hidden Markov Models detect hand gestures from wearable sEMG signals.
problem Detecting activity regions in continuous sEMG signals.
method Hidden Markov Models applied to sEMG signals for gesture recognition.
result Average accuracy of 96.25% for activity onsets and 87.5% for activity terminations.
Efficient algorithm for mobile health provides timely physical activity suggestions.
problem Inefficient reinforcement learning for mobile health settings.
method Contextual bandit algorithm with linear mixed effects model and hyper-parameter updating.
result Improves speed and accuracy by up to 99% and 56%.
Optimizes identifying top-k items from comparisons with minimal comparisons.
problem Finding the top-k items from pairwise comparisons with a fixed error rate.
method Developed an asymptotically optimal algorithm using primal-dual procedure and adaptive comparison allocation.
result Proves the algorithm is asymptotically optimal for top-k identification.
Leveraging the wealth of unlabeled data produced in recent years provides great potential for improving supervised models. When the cost of acquiring labels is high, probabilistic active learning methods can be used to greedily select the most informative data points to be labeled. However, for many large-scale problem…
This paper reduces labeling costs for meta-learning in wireless systems.
problem Expensive labeling in meta-learning for wireless systems.
method Bayesian active task selection mechanism.
result Reduces the number of labeling steps required for meta-learning.
New framework improves fairness in small data settings.
problem Ensuring fairness in low-data environments.
method Combines posterior sampling exploration with fair classification.
result Framework maximizes accuracy while meeting fairness constraints.
Echo state networks with random weights can approximate any continuous system.
problem Approximating continuous dynamical systems using echo state networks.
method Randomly generated internal weights and a sampling procedure for activation functions.
result Echo state networks with random weights can approximate any continuous casual time-invariant operators with high probability.
Paper develops exact convex optimization for neural networks with polynomial activations.
problem Training two-layer neural networks with nonlinear polynomial activations.
method Exact convex optimization using semidefinite programming.
result Global optimization of neural networks is polynomial-time computable.
New binary AA methods improve on existing techniques.
problem Binary data limitations in AA methods.
method Proposed two optimization frameworks for binary AA.
result Superior performance on synthetic and real binary data.
Proposes an efficient algorithm for mHealth that makes real-time physical activity suggestions.
problem Training complex models efficiently in real-time mHealth applications.
method Streamlined empirical Bayes procedure for fitting linear mixed effects models.
result Improves accuracy and speed over state-of-the-art approaches in mHealth applications.
Observing prices of European put and call options, we calibrate exponential Lévy models nonparametrically. We discuss the efficient implementation of the spectral estimation procedures for Lévy models of finite jump activity as well as for self-decomposable Lévy models. Based on finite sample variances, confidence inte…
Commercial activity trackers are set to become an essential tool in health research, due to increasing availability in the general population. The corresponding vast amounts of mostly unlabeled data pose a challenge to statistical modeling approaches. To investigate the feasibility of deep learning approaches for unsup…
Study challenges the Gaussian pre-activations assumption in neural networks.
problem Challenges the assumption that pre-activations are Gaussian in neural networks.
method Constructs pairs of activation functions and initialization distributions to ensure Gaussian pre-activations.
result Discovered constraints for ensuring Gaussian pre-activations in neural networks.
Active learning method for neural population dynamics using optogenetics.
problem Efficiently selecting neurons to stimulate for identifying neural population dynamics.
method Developed active learning procedure for low-rank regression to determine informative photostimulation patterns.
result Demonstrated a two-fold reduction in data required for predictive power using low-rank linear dynamical systems model.
We propose a mathematical procedure for finding informed trader activities in European-style options and their underlying asset. The regression model (9) with moving average component was written. Being added to it ARMA-process for log-price differences of underlying asset, the generalized model is written as Vector AR…
A new method optimizes spatial sampling for level set estimation in one dimension.
problem Efficiently localizing regions above/below a threshold function.
method Finite-horizon search procedure balancing estimation error and travel distance.
result Method significantly improves estimation accuracy at lower travel costs.
Many iterative procedures in stochastic optimization exhibit a transient phase followed by a stationary phase. During the transient phase the procedure converges towards a region of interest, and during the stationary phase the procedure oscillates in that region, commonly around a single point. In this paper, we devel…
New algorithms reduce label collection for online prediction with expert advice.
problem Efficiently predicting binary sequences with expert advice using fewer labels.
method Adaptive selective sampling for exponentially weighted forecasters.
result Label complexity scales roughly as the square root of the number of rounds for a scenario with a strictly better expert.
We present safe active incremental feature selection~(SAIF) to scale up the computation of LASSO solutions. SAIF does not require a solution from a heavier penalty parameter as in sequential screening or updating the full model for each iteration as in dynamic screening. Different from these existing screening methods,…
Tempered sigmoids improve deep learning privacy.
problem Privacy-preserving deep learning with strict differential privacy guarantees.
method Developed tempered sigmoid activation functions for deep learning models.
result Tempered sigmoids outperform ReLU in achieving state-of-the-art accuracy.
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.
We present two Bayesian procedures to infer the interactions and external currents in an assembly of stochastic integrate-and-fire neurons from the recording of their spiking activity. The first procedure is based on the exact calculation of the most likely time courses of the neuron membrane potentials conditioned by …
A significantly faster algorithm is presented for the original kNN mode seeking procedure. It has the advantages over the well-known mean shift algorithm that it is feasible in high-dimensional vector spaces and results in uniquely, well defined modes. Moreover, without any additional computational effort it may yield …
New model handles missing data effectively in autoregressive models.
problem Handling missing data in autoregressive models.
method Reinterpret existing models through missing data lens, introduce principled framework for incomplete datasets, active information acquisition.
result MO-ARM consistently outperforms imputation baselines across real-world benchmarks.
RAAL optimizes black box function optimization with multifidelity models.
problem Time-consuming and unfeasible black box optimization.
method Resource Aware Multifidelity Active Learning (RAAL) for efficient optimization.
result RAAL optimizes black box function optimization with multifidelity models.
How can we find a general way to choose the most suitable samples for training a classifier? Even with very limited prior information? Active learning, which can be regarded as an iterative optimization procedure, plays a key role to construct a refined training set to improve the classification performance in a variet…
Committee neural network potentials control generalization errors and enable active learningphysics.chem-ph
Committee neural network models improve accuracy and enable active learning for interatomic potentials.
problem Improving accuracy and generalization error in interatomic potentials.
method Adapting committee models to neural networks, using multiple models with shared descriptors, and applying active learning to select configurations.
result Committee disagreement provides a measure of generalization error and guides active learning to minimize it.
Asymptotic Theory of Iterated Empirical Risk Minimization, with Applications to Active Learningstat.ML
Study iterated ERM in active learning, deriving test error bounds.
problem Statistical dependencies in active learning with reused data.
method Sharp asymptotic analysis of test error for linear models.
result Double-descent behavior in test error due to data selection.
Coop-FTPL algorithm minimizes network regret in semi-bandit settings.
problem Online combinatorial optimization with semi-bandit feedback on a network of agents.
method Cooperative Follow The Perturbed Leader (Coop-FTPL) algorithm with new loss estimation procedure.
result Expected regret of Coop-FTPL is of order Q mkT log(k)(kα1 /Q + m), with a state-of-the-art computational complexity of T^3/2.
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.
Classification algorithms aim to predict an unknown label (e.g., a quality class) for a new instance (e.g., a product). Therefore, training samples (instances and labels) are used to deduct classification hypotheses. Often, it is relatively easy to capture instances but the acquisition of the corresponding labels remai…
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.
Unified perspective unites Bayesian optimization and active learning for efficient goal-oriented optimization.
problem Efficiently optimize expensive engineering and scientific problems with limited data.
method Unified framework linking Bayesian infill criteria and active learning criteria.
result Unified approach formalizes Bayesian infill criteria and active learning criteria.
Bridging the Gap Between Layout Pattern Sampling and Hotspot Detection via Batch Active Learningcs.LG
Layout hotpot detection is one of the main steps in modern VLSI design. A typical hotspot detection flow is extremely time consuming due to the computationally expensive mask optimization and lithographic simulation. Recent researches try to facilitate the procedure with a reduced flow including feature extraction, tra…
New algorithms for decision trees with noisy outcomes improve learning efficiency.
problem Learning with noisy outcomes in active learning.
method Approximation algorithms for optimal decision trees with persistent noise.
result Approximation algorithms provide nearly optimal performance guarantees.
IUPM monitors machine learning models under gradual shifts using optimal transport and active labeling.
problem Gradual distribution shifts lead to unnoticed accuracy declines in machine learning models.
method Incremental Uncertainty-aware Performance Monitoring (IUPM) using optimal transport and active labeling.
result IUPM outperforms existing baselines in gradual shift scenarios and guides label acquisition more effectively.