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

265277103 · Jun 202019922001200920172026
48 results for repeating patterns

FSNet improves online time series forecasting by balancing fast adaptation and old knowledge.

problem Online time series forecasting challenges in handling abrupt and recurring patterns.
method Inspired by CLS theory, FSNet uses a dynamic balance between fast adaptation and old knowledge retrieval.
result FSNet achieves robustness to both new and recurring patterns through dynamic balancing and associative memory.

Model predicts Bitcoin's future movements using multimodal pattern matching.

problem Challenges in predicting Bitcoin's volatile future movements.
method Ranking similar past chart patterns given current chart information.
result Improves directional prediction of Bitcoin's future movements.

This paper finds a new way to compress CNN weights, improving on pruning and quantization.

problem Improving performance and storage efficiency of CNNs.
method Identifying and exploiting repeated patterns in CNN weight tensors, using Huffman coding and block sparse matrix formats.
result Achieved compaction ratios of 1.4x to 3.1x in addition to pruning and quantization.

STICC clusters geographic objects considering both spatial contiguity and attributes.

problem Discovering repeated geographic patterns with spatial contiguity.
method Spatial Toeplitz Inverse Covariance-Based Clustering (STICC) method.
result STICC significantly outperforms baseline methods in adjusted rand index and macro-F1 score.

The paper uses pattern similarity-based methods for mid-term electricity demand forecasting.

problem Forecasting monthly electricity demand with seasonal patterns.
method Pattern similarity-based machine learning models (nearest neighbor, fuzzy neighborhood, kernel regression, GRNN).
result The proposed models outperform classical and state-of-the-art models in accuracy and simplicity.

Using publicly available traffic camera data in New York City, we quantify time-dependent patterns in aggregate pedestrian foot traffic. These patterns exhibit repeatable diurnal behaviors that differ for weekdays and weekends but are broadly consistent across neighborhoods in the borough of Manhattan. Weekday patterns…

2019-10-06abs ↗pdf ↗

BERT-based architectures currently give state-of-the-art performance on many NLP tasks, but little is known about the exact mechanisms that contribute to its success. In the current work, we focus on the interpretation of self-attention, which is one of the fundamental underlying components of BERT. Using a subset of G…

2019-08-21abs ↗pdf ↗

Anomaly detection has numerous applications and has been studied vastly. We consider a complementary problem that has a much sparser literature: anomaly description. Interpretation of anomalies is crucial for practitioners for sense-making, troubleshooting, and planning actions. To this end, we present a new approach c…

2017-08-20abs ↗pdf ↗

In this paper we outline initial concepts for an immune inspired algorithm to evaluate price time series data. The proposed solution evolves a short term pool of trackers dynamically through a process of proliferation and mutation, with each member attempting to map to trends in price movements. Successful trackers fee…

2010-04-22abs ↗pdf ↗

Price movements of stock market are not totally random. In fact, what drives the financial market and what pattern financial time series follows have long been the interest that attracts economists, mathematicians and most recently computer scientists [17]. This paper gives an idea about the trend analysis of stock mar…

2013-11-19abs ↗pdf ↗

CENNSurv models cumulative effects of time-dependent exposures on survival outcomes.

problem Challenges in modeling cumulative effects of time-dependent exposures on survival outcomes.
method CENNSurv, a novel deep learning approach that captures dynamic risk relationships from time-dependent data.
result CENNSurv reveals multi-year lagged and short-term behavioral shifts in survival outcomes.

Humans are capable of building holistic representations for images at various levels, from local objects, to pairwise relations, to global structures. The interpretation of structures involves reasoning over repetition and symmetry of the objects in the image. In this paper, we present the Program-Guided Image Manipula…

2019-09-04abs ↗pdf ↗

Significant strides have been made toward designing better generative models in recent years. Despite this progress, however, state-of-the-art approaches are still largely unable to capture complex global structure in data. For example, images of buildings typically contain spatial patterns such as windows repeating at…

2019-01-24abs ↗pdf ↗

Cryptocurrency market activity is decomposed into recurring and noise components, revealing patterns tied to macroeconomic reports.

problem Investigating temporal patterns of cryptocurrency market activity.
method Decomposition of market activity measures into recurring and noise components via correlation matrix formalism.
result Recurring market activity bursts coincide with significant U.S. macroeconomic reports, indicating their influence.

MC-GMENN improves neural networks for clustered data using Monte Carlo methods.

problem Improving neural network performance on clustered data with correlations.
method MC-GMENN employs Monte Carlo methods to train generalized mixed effects neural networks.
result MC-GMENN outperforms existing models in generalization and quantifying inter-cluster variance.

Firms miscount their customers who stop buying without saying goodbye.

problem Counting non-contractual customers accurately.
method Estimating repeat purchase probabilities and extrapolating to infinite time.
result The count of alive customers is only partially identified, with a wide range of estimates.

Optimal strategies are found for a repeated betting game using diffusion approximation.

problem Finding optimal strategies for a repeated betting game with i.i.d. outcomes.
method Constructing a diffusion approximation of the repeated game and analyzing the wealth share process.
result Necessary and sufficient conditions for the wealth share process to be transient or recurrent are derived.

Model detects patterns in noisy binary data, explaining neuron activity in terms of cell assemblies.

problem Detecting structure in noisy or approximate repeats of patterns in sparse binary data.
method Probabilistic binary latent variable model based on Noisy-OR model, inferring sparse activity in latent variables.
result Model successfully extracts and explains latent structure in spiking neural data.

Improved RTM uses integer weights to reduce computation and increase interpretability.

problem Lack of interpretability in nonlinear regression models.
method Integer weighted RTM clauses, combined with a novel learning scheme.
result Significantly reduced computation cost with improved accuracy.

This paper enhances ML algorithms by improving data locality and reducing redundancy.

problem Improving performance of machine learning algorithms with complex data.
method Exploiting data locality and reuse in memory hierarchies of modern processors.
result Efficient implementation of machine learning algorithms can be achieved by reusing computation results.

Study explores algorithmic collusion in repeated games using various learning dynamics.

problem Understanding algorithmic collusion in repeated games with different learning dynamics.
method Examines QQ-learning, gradient learning, and other dynamics in a general repeated game setting.
result Characterizes the set of payoff vectors achievable by these dynamics, revealing possibilities for collusion.

We study two systems of tangle equations that arise when modeling the action of the Integrase family of proteins on DNA. These two systems--direct and inverted repeats--correspond to two different possibilities for the initial DNA sequence. We present one new class of solutions to the tangle equations. In the case of i…

2004-12-23abs ↗pdf ↗

We investigate the question of when distinct branched surfaces in the complement of a 2-bridge knot support essential surfaces with identical boundary slopes. We determine all instances in which this occurs and identify an infinite family of knots for which no boundary slopes are repeated.

2015-02-16abs ↗pdf ↗

LAFF algorithm balances adaptability and non-exploitability in repeated games.

problem Low regret in repeated games against unknown opponent classes.
method LAFF algorithm searches within sub-algorithms optimal for each opponent class and uses a punishment policy for exploitation.
result LAFF guarantees sublinear regret uniformly over possible opponents, except exploitative ones, for which it guarantees linear regret.

Thanks to the rise of wearable and connected devices, sensor-generated time series comprise a large and growing fraction of the world's data. Unfortunately, extracting value from this data can be challenging, since sensors report low-level signals (e.g., acceleration), not the high-level events that are typically of in…

2016-09-29abs ↗pdf ↗

It has long been known that a Milnor invariant with no repeated index is an invariant of link homotopy. We show that Milnor's invariants with repeated indices are invariants not only of isotopy, but also of self C_k-moves. A self C_k-move is a natural generalization of link homotopy based on certain degree k clasper su…

2005-11-21abs ↗pdf ↗

Study optimizes product assortment for retailers with repeated exposures and patience costs.

problem Optimizing product assortment for online retailers with repeated exposures and varying consumer patience.
method Developed a cascade multinomial logit model to capture repeated exposures and patience costs.
result Proposed an approximation solution to the assortment optimization problem.

Graph Neural Networks (GNNs) are based on repeated aggregations of information across nodes' neighbors in a graph. However, because common neighbors are shared between different nodes, this leads to repeated and inefficient computations. We propose Hierarchically Aggregated computation Graphs (HAGs), a new GNN graph re…

2019-06-09abs ↗pdf ↗

To promote economic stability, finance should be studied as a hard science, where scientific methods apply. When a trading strategy is proposed, the underlying model should be transparent and defined robustly to allow other researchers to understand and examine it thoroughly. Like any hard sciences, results must be rep…

2018-08-23abs ↗pdf ↗