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.

169,051 papers · 148 categories

Trend · papers per month

11.5%23.0%34.4%45.9% · Jun 202019922001200920182026
48 results for Activity Data

RAN model recognizes multiple activities from unlabeled sensor data.

problem Handling weakly labeled multi-activity data from wearable sensors.
method Recurrent Attention Networks (RAN) for sequential multi-activity recognition and localization.
result RAN model can infer multiple activities and determine activity locations from unlabeled data.

Active learning improves SR by proposing experiments in data-limited settings.

problem Efficiently gathering data for symbolic regression with physical constraints.
method Query by committee using the Pareto frontier of equations, with physical constraints.
result Reduces data required for SR and achieves state-of-the-art results.

New proof shows neural networks can memorize training data with high accuracy.

problem Proving neural networks can memorize training data with high accuracy.
method Probabilistic construction exploiting sparsity.
result Proves neural networks with threshold or mixed threshold-ReLU activations can memorize training data.

Recovering edge activities from node activity data in temporal networks.

problem Recovering lost edge activity data from aggregated node activity data in temporal networks.
method Analyzing the relationship between edge activity and node activity data, using both theoretical and empirical methods to show recovery is possible and under what conditions.
result Recovery of edge activities from node activities is possible with surprising accuracy, even when network density increases.

Improved active learning for counterfactual learning from observational data.

problem Learning a classifier from observational data with selection bias.
method Active learning with a counterfactual risk minimizer, modifying both risk and active learning process.
result Statistically consistent and more label-efficient algorithm compared to prior work.

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.

Even though active learning forms an important pillar of machine learning, deep learning tools are not prevalent within it. Deep learning poses several difficulties when used in an active learning setting. First, active learning (AL) methods generally rely on being able to learn and update models from small amounts of …

2017-03-08abs ↗pdf ↗

Active inference uses machine learning to prioritize data labeling for more efficient statistical inference.

problem Efficiently collecting data points for statistical inference with limited labels.
method A machine learning-assisted approach that identifies uncertain data points for labeling.
result Achieves the same level of accuracy with fewer samples, resulting in smaller confidence intervals and more powerful p-values.

New active learning method uses combinatorial coverage to improve data transfer and reduce bias.

problem Inability to transfer sampled data to new models and sampling bias issues.
method Data-centric active learning methods utilizing combinatorial coverage.
result Sampling data with coverage leads to better data transfer and competitive sampling bias.

This research improves neural network performance with adaptive activation functions in sparse data settings.

problem Limited data availability in scientific and engineering problems.
method Investigation of two types of adaptive activation functions with individual trainable parameters.
result Adaptive activation functions, especially with individual trainable parameters, enhance prediction accuracy and confidence in sparse data settings.

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.

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.

Proposes a graph-based method for active learning in regression.

problem Active learning for regression is understudied and faces challenges with noisy labels and parameter uncertainty.
method Formulates active regression as a bipartite graph optimization problem.
result Demonstrates the effectiveness of the proposed graph-based approach on benchmark data sets.

Active data collection improves convergence rates in operator learning.

problem Improving convergence rates in operator learning with linear target and stochastic input.
method Active data collection strategies with mean-zero stochastic process and continuous covariance kernels.
result Achieves arbitrarily fast error convergence rates with eigenvalue decay of covariance kernels.

New active learning strategy improves decision-making accuracy.

problem Maximizing decision-making accuracy in sequential data acquisition.
method Introduces a novel active learning criterion that maximizes expected information gain on the posterior decision distribution.
result Improved performance in decision-making accuracy compared to existing alternatives.

EmbraceNet fusion model for multi-sensor activity recognition.

problem Human activity recognition using multiple sensors is challenging.
method Independent processing of each sensor, feature fusion with EmbraceNet, post-processing, and additional processes.
result Improved performance in SHL recognition challenge.

Improved DNN robustness to adversarial attacks using data-dependent activation and total variation minimization.

problem Improving Deep Neural Network robustness to adversarial attacks.
method Data-dependent activation function and total variation minimization.
result Robust accuracy of adversarially trained ResNet20 increased from ~46% to ~69% under IFGSM attack.

Efficient active learning method defends against malicious mislabeling and data poisoning attacks.

problem Malicious mislabeling and data poisoning attacks on deep neural networks.
method Adversarial retraining and active learning with random sampling strategy.
result The proposed method achieves 89% accuracy with only one-third of the labeled data, significantly outperforming the baseline method.

Paper presents a neural network for recognizing human activities from unlabeled sensor data.

problem Time-consuming annotation of sensor data for activity recognition.
method Attention-based convolutional neural network for weakly labeled data.
result Attention model improves accuracy in recognizing human activities.

FedMAX tackles activation divergence in FL, improving accuracy and efficiency.

problem Activation divergence in Federated Learning due to non-IID data.
method Introduced a prior based on maximum entropy to minimize information about per-device activation vectors and make similar classes more alike.
result Significantly more similar activation vectors across multiple devices, leading to better accuracy and efficiency.

Data-aware activation function customization reduces neural network error.

problem Current neural networks lack consideration for specific activation functions.
method Linear algebraic explanation and Diaconis-Shahshahani Approximation Theorem criteria for activation functions.
result Using an even activation function like seagull can reduce neural network error by orders of magnitude.

Active testing for large language models is made more efficient and accurate.

problem Efficient evaluation of large language models with limited labels.
method Cost-saving measures and in-context learning for constructing a surrogate model.
result Significantly more accurate evaluations of LLM performance compared to random data acquisition.

This paper proposes a new method to select labeled data points using VAEs for active learning.

problem High cost of acquiring labels in supervised machine learning.
method Data-driven approach using Variational Autoencoders (VAEs) to select a diverse core-set in a low-dimensional latent space.
result Improvement in accuracy over related techniques, highlighting the representation power of generative modeling.

Paper improves anomaly detection using tree-based ensembles with active learning.

problem Configuring anomaly detectors with true labels to minimize false positives.
method Develops batch and streaming active learning algorithms for tree-based ensembles.
result Significantly more anomalies discovered with active learning compared to baselines.

Bayesian active learning method improved for censored regression data.

problem Challenges in estimating BALD for censored regression data.
method Derived entropy and mutual information for censored distributions, developed C\mathcal{C}-BALD objective, proposed novel modelling approach.
result Demonstrated C\mathcal{C}-BALD outperforms other methods in censored regression.

SparseSense improves HAR from sparse sensor data, outperforming state-of-the-art models.

problem Learning activity recognition from highly sparse sensor data streams.
method Set-based neural networks for end-to-end learning from sparse data.
result Significant performance improvements in HAR from passive sensor datasets.

Periodic activation functions improve neural network reliability and interpretability.

problem Neural networks reinforce hidden biases, making them unreliable and hard to interpret.
method Introduce periodic activation functions in Bayesian neural networks to establish a connection with stationary Gaussian process priors.
result Periodic activation functions, including sinusoidal, triangular, and ReLU, improve model performance and sensitivity to perturbations.

Two machine learning methods detect insider trading from investor activity data.

problem Detecting insider trading from trading activity data is challenging.
method Two unsupervised machine learning methods: clustering and group identification.
result Identifies potential insider trading rings around price sensitive events.

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.