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

13.8%27.7%41.5%55.4% · May 202619922001200920172026
48 results for active level set estimation

Paper presents a robust transfer learning method for active level set estimation.

problem Efficiently identifying regions of a black-box function with limited function evaluations.
method Incorporates prior knowledge from a related function while locally adapting it.
result The method achieves better convergence of level sets compared to standard transfer learning.

New acquisition functions improve Bernoulli LSE.

problem Efficiently estimating regions where a Bernoulli function is above or below a threshold.
method Developed new look-ahead acquisition functions for Gaussian process classification models.
result Demonstrated clear benefits of new acquisition functions on benchmark and real-world tasks.

Study proposes active learning method for estimating robust regions in uncertain function evaluations.

problem Estimating robust regions for uncertain function evaluations with unknown distributions.
method Distributionally robust level-set estimation (DRPTR) with active learning.
result The proposed method efficiently identifies reliable regions with theoretical guarantees.

We define a Hidden Markov Model (HMM) in which each hidden state has time-dependent activity levels\textit{activity levels} that drive transitions and emissions, and show how to estimate its parameters. Our construction is motivated by the problem of inferring human mobility on sub-daily time scales from, for example, mobile phone …

2015-07-27abs ↗pdf ↗

We introduce the active exploration problem in Markov decision processes (MDPs). Each state of the MDP is characterized by a random value and the learner should gather samples to estimate the mean value of each state as accurately as possible. Similarly to active exploration in multi-armed bandit (MAB), states may have…

2019-02-28abs ↗pdf ↗

Paper extends Chernoff sampling for active testing and parameter estimation, improving neural network and regression models.

problem Reducing sample complexity in hypothesis testing and model parameter estimation.
method Developed an extension of Chernoff sampling for active learning and parameter estimation.
result Non-asymptotic bounds for sample complexity and estimation error in active learning.

New algorithm for active bipartite ranking with continuous distributions.

problem Active ranking of bipartite data with continuous conditional distributions.
method Developed a novel algorithm called smooth-rank to minimize the distance between estimated and optimal ROC curves.
result Smooth-rank algorithm is PAC-(ε,δ)(ε,δ) and outperforms existing methods in empirical tests.

New method improves level set estimation with theoretical guarantees.

problem Efficiently estimating level sets of expensive-to-evaluate functions.
method Randomized straddle algorithm for level set estimation.
result The method provides theoretical guarantees and better practical performance.

We propose a methodological framework to study the dynamics of inter-regional investment flow in Europe from a Complex Networks perspective, an approach with recent proven success in many fields including economics. In this work we study the network of investment stocks in Europe at two different levels: first, we comp…

2005-08-29abs ↗pdf ↗

Distributed securities exchanges may become de facto fragmented if they span geographical regions with asymmetric computer infrastructure. First, we build an economic model of a decentralized exchange with two miner clusters, standing in for compact areas of economic activity (e.g., cities). "Local" miners in the area …

2019-10-24abs ↗pdf ↗

We present a confidence-based single-layer feed-forward learning algorithm SPIRAL (Spike Regularized Adaptive Learning) relying on an encoding of activation spikes. We adaptively update a weight vector relying on confidence estimates and activation offsets relative to previous activity. We regularize updates proportion…

2016-11-18abs ↗pdf ↗

Suppose that we wish to estimate a user's preference vector ww from paired comparisons of the form "does user ww prefer item pp or item qq?," where both the user and items are embedded in a low-dimensional Euclidean space with distances that reflect user and item similarities. Such observations arise in numerous se…

2019-05-10abs ↗pdf ↗

A new method for active learning works well across all label budgets.

problem Active learning methods perform poorly in both low and high label budgets.
method Uncertainty Herding: a simple, computationally fast method that optimizes uncertainty coverage.
result Uncertainty Herding nearly optimizes distribution-level coverage and performs well across various active learning tasks.

Uncovering the heterogeneity of causal effects of policies and business decisions at various levels of granularity provides substantial value to decision makers. This paper develops new estimation and inference procedures for multiple treatment models in a selection-on-observables framework by modifying the Causal Fore…

2018-12-22abs ↗pdf ↗

We explore the sequential decision making problem where the goal is to estimate uniformly well a number of linear models, given a shared budget of random contexts independently sampled from a known distribution. The decision maker must query one of the linear models for each incoming context, and receives an observatio…

2017-03-02abs ↗pdf ↗

In order to model volatile real-world network behavior, we analyze phase-flipping dynamical scale-free network in which nodes and links fail and recover. We investigate how stochasticity in a parameter governing the recovery process affects phase-flipping dynamics, and find the probability that no more than q% of nodes…

2014-01-29abs ↗pdf ↗

User engagement in online social networking depends critically on the level of social activity in the corresponding platform--the number of online actions, such as posts, shares or replies, taken by their users. Can we design data-driven algorithms to increase social activity? At a user level, such algorithms may incre…

2018-02-19abs ↗pdf ↗

Proposes a method to cluster fMRI data and estimate brain connectivity networks.

problem Clustering fMRI data to identify patient groups based on brain connectivity.
method Random covariance clustering model (RCCM) to cluster subjects and estimate individual and shared FC networks.
result RCCM outperforms other methods in clustering and FC network estimation, demonstrated through simulations and real data.

Functional connectivity refers to the temporal statistical relationship between spatially distinct brain regions and is usually inferred from the time series coherence/correlation in brain activity between regions of interest. In human functional brain networks, the network structure is often inferred from functional m…

2014-12-20abs ↗pdf ↗

Recent research has shown that although Reinforcement Learning (RL) can benefit from expert demonstration, it usually takes considerable efforts to obtain enough demonstration. The efforts prevent training decent RL agents with expert demonstration in practice. In this work, we propose Active Reinforcement Learning wit…

2018-12-06abs ↗pdf ↗

Optimal noise excitation for linear system identification reduces sample complexity.

problem Efficiently identifying linear systems with minimal data.
method Active learning algorithm using ordinary least squares and semidefinite programming.
result The proposed algorithm matches lower bounds on sample complexity for any active learning method.

A new MARL framework for community-based cooperation with transfer and active exploration.

problem Flexible coordination patterns in multi-agent systems with community structures.
method Community-based multi-agent reinforcement learning with transfer and active exploration.
result Provably convergent actor-critic algorithms for structured information sharing and transfer learning.

The clusters of a distribution are often defined by the connected components of a density level set. However, this definition depends on the user-specified level. We address this issue by proposing a simple, generic algorithm, which uses an almost arbitrary level set estimator to estimate the smallest level at which th…

2014-09-30abs ↗pdf ↗

Paper proposes efficient AL algorithms for optimizing product performance under environmental variability.

problem Optimizing product performance under varying environmental conditions.
method Formulated as Bayesian Quadrature Optimization problems for probabilistic threshold robustness measure using Gaussian Process model.
result Proposed algorithms provide credible intervals for probabilistic threshold robustness measure and demonstrate efficiency in real-world applications.