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

Trend · papers per month

69138207276 · Jun 202019922001200920172026
48 results for online activity

A3RL combines online and offline RL with active sampling to improve policy learning.

problem Combining online and offline RL for sample efficiency and robustness.
method A3RL uses a confidence-aware Active Advantage Aligned (A3) sampling strategy to prioritize data from both online and offline sources.
result A3RL outperforms competing online RL techniques that use offline data.

OSAMD adapts online to changing distributions with limited labels.

problem Models struggle with continual distribution shifts and expensive labeling in changing environments.
method Online Active Continual Adaptation with OSAMD, an online teacher-student structure and margin-based criterion.
result OSAMD achieves favorable dynamic regret bounds under changing environments with limited labels.

Online active learning improves model performance in high-volume production processes.

problem Outliers degrade the predictive performance of online active learning models.
method Proposes a robust estimator and bounds the search area of a conditional D-optimal algorithm.
result The proposed method improves the performance of online active learning in the presence of outliers.

Online active regression algorithms minimize label queries for efficient data regression.

problem Efficiently predict data points with minimal label queries in an online setting.
method Proposed online algorithms for active regression under ℓ_p loss, achieving (1+ε)-approximation with minimal label queries.
result Achieves (1+ε)-approximation with only ε^(-1) d log(nκ) label queries, matching offline methods in performance.

Online purchase decisions in organizations can go through a complex journey with multiple agents involved in the decision making process. Depending on the product being purchased, and the organizational structure, the process may involve employees who first conduct market research, and then influence decision makers wh…

2019-08-29abs ↗pdf ↗

Paper proposes a method for efficient online classification using siamese networks and active learning.

problem Online learning challenges with limited, nonstationary, and imbalanced data.
method Synergistic combination of siamese neural networks and active learning with multi-sliding window approach.
result Significantly outperforms baselines and state-of-the-art algorithms in terms of learning speed and performance.

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.

Online Normalization is a new technique for normalizing the hidden activations of a neural network. Like Batch Normalization, it normalizes the sample dimension. While Online Normalization does not use batches, it is as accurate as Batch Normalization. We resolve a theoretical limitation of Batch Normalization by intro…

2019-05-15abs ↗pdf ↗

Active Learning methods create an optimized labeled training set from unlabeled data. We introduce a novel Online Active Deep Learning method for Medical Image Analysis. We extend our MedAL active learning framework to present new results in this paper. Our novel sampling method queries the unlabeled examples that maxi…

2019-08-28abs ↗pdf ↗

We study the problem of online influence maximization in social networks. In this problem, a learner aims to identify the set of "best influencers" in a network by interacting with it, i.e., repeatedly selecting seed nodes and observing activation feedback in the network. We capitalize on an important property of the i…

2019-06-09abs ↗pdf ↗

Learning the activities of animals is important for the purpose of monitoring their welfare vis a vis their behaviour with respect to their environment and conspecifics. While previous works have largely focused on activity recognition in a single animal, little or no work has been done in learning the collective behav…

2018-11-22abs ↗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 ↗

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.

Ahpatron improves online kernel learning with tighter mistake bounds.

problem Improving mistake bounds in online kernel learning with budget constraints.
method Introducing Ahpatron, a new model that uses an aggressive updating rule and a budget maintenance mechanism to approximate AVP.
result Ahpatron achieves tighter mistake bounds compared to previous models.

New insights on eluder dimension for function approximation in machine learning.

problem Complexity measure for online bandits and reinforcement learning with function approximation.
method Study the relationship between eluder dimension and generalized rank for different activation functions.
result Eluder dimension can be exponentially smaller or larger than generalized rank depending on the activation function.

Conventional learning with expert advice methods assumes a learner is always receiving the outcome (e.g., class labels) of every incoming training instance at the end of each trial. In real applications, acquiring the outcome from oracle can be costly or time consuming. In this paper, we address a new problem of active…

2013-09-26abs ↗pdf ↗

In recent years, distance education has enjoyed a major boom. Much work at The Open University (OU) has focused on improving retention rates in these modules by providing timely support to students who are at risk of failing the module. In this paper we explore methods for analysing student activity in online virtual l…

2018-11-09abs ↗pdf ↗

New collaborative algorithm improves personalized mean estimation in online settings.

problem Online estimation of means from multiple, possibly overlapping distributions.
method Novel collaborative strategy for active querying and mean estimation.
result Algorithm improves mean estimates through communication among agents.

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.

New method for distributed online learning with communication constraints reduces joint regret.

problem Joint regret minimization in a distributed online learning setting with communication constraints.
method Adaptive graph partitioning and comparator-adaptive online convex optimization with delayed gradient information.
result Optimal graph partition selection for adversarial activations and gradients reduces joint regret.

Real-time personalization for HAR models learns from new users without prior data.

problem Poor performance of HAR models on new users without labeled data.
method Incremental online domain adaptation using batch normalization.
result Personalized HAR models adapt to new users in real-time.

In this work we propose Hebbian-descent as a biologically plausible learning rule for hetero-associative as well as auto-associative learning in single layer artificial neural networks. It can be used as a replacement for gradient descent as well as Hebbian learning, in particular in online learning, as it inherits the…

2019-05-25abs ↗pdf ↗

We consider the problem of online active learning to collect data for regression modeling. Specifically, we consider a decision maker with a limited experimentation budget who must efficiently learn an underlying linear population model. Our main contribution is a novel threshold-based algorithm for selection of most i…

2016-02-09abs ↗pdf ↗

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 ↗

New active learning method for kernel selection improves efficiency and accuracy.

problem Real-world applications where acquiring true labels is costly or time-consuming.
method Active Multiple Kernel Learning (AMKL) with adaptive kernel selection (AMKL-AKS).
result AMKL-AKS achieves optimal sublinear regret and better performance with fewer labeled data.

Online Active Learning (OAL) aims to manage unlabeled datastream by selectively querying the label of data. OAL is applicable to many real-world problems, such as anomaly detection in health-care and finance. In these problems, there are two key challenges: the query budget is often limited; the ratio between classes i…

2019-11-18abs ↗pdf ↗

We present a new algorithm based on an gradient ascent for a general Active Exploration bandit problem in the fixed confidence setting. This problem encompasses several well studied problems such that the Best Arm Identification or Thresholding Bandits. It consists of a new sampling rule based on an online lazy mirror …

2019-05-20abs ↗pdf ↗

We study an asynchronous online learning setting with a network of agents. At each time step, some of the agents are activated, requested to make a prediction, and pay the corresponding loss. The loss function is then revealed to these agents and also to their neighbors in the network. Our results characterize how much…

2019-01-23abs ↗pdf ↗