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

4896144192 · Jun 202019922001200920172026
48 results for activation identification

Proposes privacy-preserving sensor data transformations to prevent user re-identification and sensitive activity inference.

problem Privacy threats from shared sensor data and potential user re-identification.
method Mechanisms to transform sensor data to eliminate patterns for re-identification and sensitive activity inference, while maintaining minor utility loss.
result Reduced user re-identification accuracy to random guess level and prevented inference of sensitive activities.

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.

The paper proposes a method to identify latent factors from sampled and fired graph data.

problem Identifying latent factors from sampled and fired graph data.
method The paper presents a theoretical and practical approach to build an identifier of latent factor activations.
result The method successfully identifies latent factor activations from sampled and fired graph data.

Activity and motion analysis has the potential to be used as a diagnostic tool for mental disorders. However, to-date, little work has been performed in turning stratification measures of activity into useful symptom markers. The research presented in this thesis has focused on the identification of objective activity …

2019-08-14abs ↗pdf ↗

We introduce interactive structure discovery, a generic framework that encompasses many interactive learning settings, including active learning, top-k item identification, interactive drug discovery, and others. We adapt a recently developed active learning algorithm of Tosh and Dasgupta (2017) for interactive structu…

2019-06-05abs ↗pdf ↗

New method detects and measures malicious users in recommendation algorithms.

problem Identifying and quantifying malicious user activity in recommendation systems.
method Probabilistic programming for a disentangled model of malicious and regular user behavior.
result Simulation-based measure for quantifying malicious user effects.

Paper introduces a new method to identify brain hubs using both structural and functional connectivity.

problem Hub node identification in brain networks using only functional connectivity.
method Graph signal processing framework that models functional activity as graph signals on structural connectivity.
result The proposed GraFHub framework identifies hub nodes more accurately than conventional methods.

BLADE uses Bayesian methods to discover complex systems from scarce data.

problem Efficiently discovering governing equations of complex dynamical systems from limited data.
method Combines replica-exchange stochastic gradient Langevin Monte Carlo with active learning.
result Reduces measurement requirements by 60% for Lotka-Volterra and 40% for Burgers' equation.

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 ↗

Active sampling selects few points for accurate model reduction of high-fidelity systems.

problem Efficiently identify dominant subspaces for model reduction of large training sets.
method Proposes an active sampling strategy to select a few points from the training set to estimate dominant subspaces accurately.
result Active sampling can provide 17x speed-up without sacrificing accuracy.

AE-LSVI identifies near-optimal policies in complex systems with minimal data.

problem Identifying near-optimal policies in complex, costly data acquisition systems.
method Combines optimism and pessimism for active exploration in a generative model setting.
result Proves near-optimal policy identification over entire state spaces with polynomial sample complexity.

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.

New method improves neural network robustness by identifying functions rather than parameters.

problem Neural networks' lack of robustness to distribution shifts.
method Identify the function represented by quadratic networks, not their parameters.
result Obtain robust generalization bounds for neural networks.

Motion sensors such as accelerometers and gyroscopes measure the instant acceleration and rotation of a device, in three dimensions. Raw data streams from motion sensors embedded in portable and wearable devices may reveal private information about users without their awareness. For example, motion data might disclose …

2018-10-26abs ↗pdf ↗

High throughput screening of compounds (chemicals) is an essential part of drug discovery [7], involving thousands to millions of compounds, with the purpose of identifying candidate hits. Most statistical tools, including the industry standard B-score method, work on individual compound plates and do not exploit cross…

2017-09-28abs ↗pdf ↗

Bayesian-SINDy learns differential equations from noisy data quickly.

problem Learning correct model equations from limited and noisy data.
method Bayesian-SINDy framework using Gaussian approximations.
result Bayesian-SINDy is more robust and accurate in learning correct model equations from noisy data.

Study reveals centralization in Bitcoin transactions involving retail users.

problem Centralization and bias in Bitcoin transaction data.
method Heuristic classification of Bitcoin users, weekly activity pattern analysis.
result Most real transactions involve Frequent Receivers, centralizing the ecosystem.

Deep learning methods for person identification based on electroencephalographic (EEG) brain activity encounters the problem of exploiting the temporally correlated structures or recording session specific variability within EEG. Furthermore, recent methods have mostly trained and evaluated based on single session EEG …

2019-03-27abs ↗pdf ↗

The problem of automatic identification of physical activities performed by human subjects is referred to as Human Activity Recognition (HAR). There exist several techniques to measure motion characteristics during these physical activities, such as Inertial Measurement Units (IMUs). IMUs have a cornerstone position in…

2019-06-05abs ↗pdf ↗

This paper provides a set of sensitivity analysis and activity identification results for a class of convex functions with a strong geometric structure, that we coined "mirror-stratifiable". These functions are such that there is a bijection between a primal and a dual stratification of the space into partitioning sets…

2017-07-11abs ↗pdf ↗

Automates detection of fast-ramped flexibility events for DSOs.

problem Monitoring and supervising flexibility activations in power systems.
method Unsupervised detection and open-set classification.
result Automatically identifies critical flexibility activations for early intervention.

Optimizes pure exploration in linear bandits with a new algorithm.

problem Best-arm identification in linear stochastic bandits.
method Developed the first asymptotically optimal algorithm for fixed-confidence pure exploration in linear bandits.
result Avoids the pitfall of a simple but difficult instance and bypasses the need to solve an optimal design problem.

The paper analyzes methods for sparse Bayesian regression in nonlinear system identification.

problem Learning sparse models in Bayesian regression with nonlinear applications.
method Two classes of methods: regularization and thresholding based, built on automatic relevance determination (ARD).
result Analytical demonstration of favorable performance with sparse solutions in linear problems.

Algorithm identifies Pareto front using multiple context directions and reuses exploration samples.

problem Identifying a set of arms with undominated mean reward vectors in linear bandits.
method Proposes a new estimator that updates estimates along multiple context directions and reuses exploration samples.
result Optimal sample complexity and logarithmic regret compared to optimal algorithms.

This paper studies active learning in the context of robust statistics. Specifically, we propose a variant of the Best Arm Identification problem for \emph{contaminated bandits}, where each arm pull has probability ε\varepsilon of generating a sample from an arbitrary contamination distribution instead of the true und…

2018-02-26abs ↗pdf ↗

SympNets identify Hamiltonian systems from data using linear, activation, and gradient modules.

problem Identifying Hamiltonian systems from data.
method Composition of linear, activation, and gradient modules; universal approximation theorems.
result SympNets can approximate arbitrary symplectic maps and generalize well to various Hamiltonian systems.

Availability of an explainable deep learning model that can be applied to practical real world scenarios and in turn, can consistently, rapidly and accurately identify specific and minute traits in applicable fields of biological sciences, is scarce. Here we consider one such real world example viz., accurate identific…

2017-10-24abs ↗pdf ↗