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

Trend · papers per month

128255383510 · Jun 202019922001200920172026
48 results for repetition effect

UTE improves reinforcement learning by measuring action uncertainty, enhancing policy learning efficiency.

problem Degrading performance of action repetition in reinforcement learning, especially with sub-optimal actions.
method UTE uses ensemble methods to measure uncertainty during action extension, allowing strategic exploration or certainty.
result UTE outperforms existing action repetition algorithms, significantly enhancing policy learning efficiency.

Study shows how repetition affects learning in bandit settings, providing algorithms with sublinear regret.

problem Effect of persistence of engagement on learning in stochastic multi-armed bandit settings.
method Novel algorithms that achieve sublinear regret under temporal constraints.
result Additive effect of priming on regret upper bound, matching popular algorithms in absence of priming.

Generative model captures repetitive industrial processes with varying durations and dynamics.

problem Capturing repetitive industrial processes with varying durations and dynamics using Gaussian Processes.
method Posterior-weighted Gaussian Process with a novel kernel to decouple intra-repetition and inter-repetition variability.
result Generative model produces realistic synthetic trajectories from toy datasets.

Spaced repetition is a technique for efficient memorization which uses repeated, spaced review of content to improve long-term retention. Can we find the optimal reviewing schedule to maximize the benefits of spaced repetition? In this paper, we introduce a novel, flexible representation of spaced repetition using the …

2017-12-05abs ↗pdf ↗

This paper considers the problem of characterizing the simplest discrete point sets that are aperiodic, using invariants based on topological dynamics. A Delone set whose patch-counting function N(T), for radius T, is finite for all T is called repetitive if there is a function M(T) such that every ball of radius M(T)+…

1999-09-06abs ↗pdf ↗

We study the effect of impairment on stochastic multi-armed bandits and develop new ways to mitigate it. Impairment effect is the phenomena where an agent only accrues reward for an action if they have played it at least a few times in the recent past. It is practically motivated by repetition and recency effects in do…

2018-11-22abs ↗pdf ↗

This study investigates abrupt learning dynamics in Transformers, revealing plateau formation and internal representation collapse.

problem Abrupt learning in Transformers, particularly during the loss plateau.
method Investigates mechanisms of abrupt learning in shallow Transformers, focusing on attention maps and hidden states.
result Reveals plateau formation, internal representation collapse, and strong repetition bias in outputs.

The paper uses persistent homology to estimate recurrence times in multi-variate time series.

problem Estimating recurrence times in multi-variate time series with different cyclic behaviors.
method Persistent homology framework with three specialized methods.
result Validated methods on real-world data, including a new benchmark dataset.

In online display advertising, selecting the most effective ad creative (ad image) for each impression is a crucial task for DSPs (Demand-Side Platforms) to fulfill their goals (click-through rate, number of conversions, revenue, and brand improvement). As widely recognized in the marketing literature, the effect of ad…

2019-08-21abs ↗pdf ↗

This work uses QPGPs to improve ILC performance in repetitive tasks.

problem Performance degradation in repetitive motion tasks due to environmental changes and robot wear.
method Incorporates Quasi-Periodic Gaussian Processes into a predictive ILC framework.
result The proposed approach achieves faster convergence and robustness under disturbances.

Bayesian optimization outperforms other methods in hyperparameter tuning for reinforcement learning.

problem Finding optimal hyperparameters that generalize across random seeds in reinforcement learning.
method Benchmarked Successive Halving, Random Search, and Bayesian Optimization with and without repetitions on PPO2 algorithms for Cartpole and Inverted Pendulum tasks.
result Bayesian optimization with noise robust acquisition function is the best choice.

Automatic conflict detection has grown in relevance with the advent of body-worn technology, but existing metrics such as turn-taking and overlap are poor indicators of conflict in police-public interactions. Moreover, standard techniques to compute them fall short when applied to such diversified and noisy contexts. W…

2017-11-14abs ↗pdf ↗

Experimental design is a classical statistics problem and its aim is to estimate an unknown mm-dimensional vector ββ from linear measurements where a Gaussian noise is introduced in each measurement. For the combinatorial experimental design problem, the goal is to pick kk out of the given nn experiments so as to m…

2018-02-23abs ↗pdf ↗

Study on estimating causal effects with limited data and multiple environments.

problem Estimating causal effects under hidden confounding with unpaired data and sparse effects.
method Instrumental variable (IV) regression with cross-fold sample splitting and 1\ell_1-regularized estimation.
result Proposed GMM-type estimator is consistent as the number of environments grows.

Most recent semi-supervised deep learning (deep SSL) methods used a similar paradigm: use network predictions to update pseudo-labels and use pseudo-labels to update network parameters iteratively. However, they lack theoretical support and cannot explain why predictions are good candidates for pseudo-labels. In this p…

2019-08-09abs ↗pdf ↗

Data repetition improves SGD's learning of high-dimensional functions.

problem Learning pertinent features in multi-index models with high-dimensional noisy data.
method Investigation of two-layer shallow neural networks trained with gradient-based algorithms, focusing on data repetition.
result Data repetition significantly improves the computational efficiency of SGD, learning all directions with at most O(dlogd)O(d \log d) steps.

Project infinite time series graphs to finite marginal models using number theory.

problem Handling infinite time series graphs for causal inference.
method Projection method using number theory to find common ancestors in infinite graphs.
result Developed algorithm to project infinite graphs to finite marginal models.

Estimates linear model from noisy covariates and instruments using spectral regularization.

problem Estimating a linear model from many noisy covariates and instruments.
method Two-stage least squares with spectral regularization of canonical correlations.
result Upper and lower bounds on estimation error, proving optimality of the method with noisy data.

EB-RANSAC uses energy-based model for robust estimation without complex sampling.

problem Robust estimation of parameters in noisy data.
method EB-RANSAC combines RANSAC's sampling scheme with an energy-based model, simplifying the process and reducing hyperparameter requirements.
result EB-RANSAC effectively solves linear regression and maximum likelihood estimation problems.

It is proved that any (repetitive) Riemannian manifold of bounded geometry can be realized as a leaf of some (minimal) Riemannian matchbox manifold without holonomy. Our methods can be adapted to achieve Cantor transversals or a prescribed holonomy covering, but then the manifold may not be realized as a dense leaf.

2020-02-20abs ↗pdf ↗

X-ray free-electron lasers (XFELs) are the only sources currently able to produce bright few-fs pulses with tunable photon energies from 100 eV to more than 10 keV. Due to the stochastic SASE operating principles and other technical issues the output pulses are subject to large fluctuations, making it necessary to char…

2016-10-11abs ↗pdf ↗

Neural text generation is a key tool in natural language applications, but it is well known there are major problems at its core. In particular, standard likelihood training and decoding leads to dull and repetitive outputs. While some post-hoc fixes have been proposed, in particular top-kk and nucleus sampling, they …

2019-08-12abs ↗pdf ↗

Open-domain dialog generation is a challenging problem; maximum likelihood training can lead to repetitive outputs, models have difficulty tracking long-term conversational goals, and training on standard movie or online datasets may lead to the generation of inappropriate, biased, or offensive text. Reinforcement Lear…

2019-09-17abs ↗pdf ↗

Prior work on training generative Visual Dialog models with reinforcement learning(Das et al.) has explored a Qbot-Abot image-guessing game and shown that this 'self-talk' approach can lead to improved performance at the downstream dialog-conditioned image-guessing task. However, this improvement saturates and starts d…

2019-09-23abs ↗pdf ↗

The sophisticated structure of Convolutional Neural Network (CNN) allows for outstanding performance, but at the cost of intensive computation. As significant redundancies inevitably present in such a structure, many works have been proposed to prune the convolutional filters for computation cost reduction. Although ex…

2018-10-12abs ↗pdf ↗

Variance-Calibrated Modulation (VCM) addresses the likelihood trap in LLMs by reshaping the probability distribution before truncation.

problem LLMs fall into the likelihood trap, leading to repetitive degeneration and vocabulary dullness.
method VCM reshapes the probability distribution before truncation through Contextual Searchlight and Adaptive Self-Debiasing.
result VCM mitigates the likelihood trap across open-ended generation, factual QA, and mathematical reasoning.

Hyperfitting improves LLM generation quality by enhancing diversity, contrary to simple temperature scaling.

problem Improving open-ended generation quality of LLMs with minimal fine-tuning effort.
method Demonstrates that hyperfitting, a phenomenon where LLMs are fine-tuned to near-zero training loss, enhances generation quality and mitigates repetition.
result Hyperfitting is distinct from temperature scaling and involves a dynamic, context-dependent rank reordering mechanism in the final transformer block.

Investigates the number of experiments needed for statistical significance in medication testing.

problem Determining the number of experiments needed for a statistically significant result.
method Examines binomial and general probability distributions, considering placebo efficacy and varying distributions.
result The number of experiments needed can be significantly higher when placebo efficacy is considered.

One basic requirement of many studies is the necessity of classifying data. Clustering is a proposed method for summarizing networks. Clustering methods can be divided into two categories named model-based approaches and algorithmic approaches. Since the most of clustering methods depend on their input parameters, it i…

2013-02-16abs ↗pdf ↗

SIFG uses noisy particles to efficiently sample from complex distributions.

problem Efficient sampling from complex distributions using particle-based methods.
method SIFG introduces a semi-implicit functional gradient flow with Gaussian noise to improve sampling efficiency and accuracy.
result SIFG achieves strong theoretical convergence guarantees and efficient sampling.

This work addresses the problem of segmentation in time series data with respect to a statistical parameter of interest in Bayesian models. It is common to assume that the parameters are distinct within each segment. As such, many Bayesian change point detection models do not exploit the segment parameter patterns, whi…

2017-10-26abs ↗pdf ↗

In continual learning (CL), an agent learns from a stream of tasks leveraging prior experience to transfer knowledge to future tasks. It is an ideal framework to decrease the amount of supervision in the existing learning algorithms. But for a successful knowledge transfer, the learner needs to remember how to perform …

2019-02-27abs ↗pdf ↗

In this paper we consider the problem of clustering collections of very short texts using subspace clustering. This problem arises in many applications such as product categorisation, fraud detection, and sentiment analysis. The main challenge lies in the fact that the vectorial representation of short texts is both hi…

2019-01-25abs ↗pdf ↗