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

Trend · papers per month

24487296 · Jun 202019922001200920172026
48 results for recurring concepts

ECPF improves classification accuracy and speed for evolving data streams.

problem Reusing classifiers trained on recurring concepts to maintain accuracy and speed.
method ECPF uses similarity of classifications to quickly identify the best classifier to reuse.
result ECPF significantly outperforms state-of-the-art frameworks on synthetic and real-world datasets.

Enhash detects concept drift in data streams quickly and efficiently.

problem Detecting abrupt, gradual, virtual, or recurring events in data streams.
method Uses projection hash to insert incoming samples and detects concept drift.
result Enhash has competitive performance and moderate resource requirements compared to existing ensemble learners.

stream-learn is a Python library for analyzing data streams with various drift types.

problem Analyzing drifting and imbalanced data streams.
method Synthetic data stream generator, evaluation methodologies, and imbalanced binary classification metrics.
result Efficient implementation of classifiers for data stream analysis.

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.

A census is presented of all closed non-orientable 3-manifold triangulations formed from at most seven tetrahedra satisfying the additional constraints of minimality and P^2-irreducibility. The eight different 3-manifolds represented by these 41 different triangulations are identified and described in detail, with part…

2003-11-07abs ↗pdf ↗

Cascades of information-sharing are a primary mechanism by which content reaches its audience on social media, and an active line of research has studied how such cascades, which form as content is reshared from person to person, develop and subside. In this paper, we perform a large-scale analysis of cascades on Faceb…

2016-02-02abs ↗pdf ↗

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.

Study examines Bitcoin's price history and identifies recurring events.

problem Understanding Bitcoin's price fluctuations and recurring events.
method Analyzed BTC price time-series (2010-2021), identified recurring events, and approximated price evolution using a Fibonacci sequence.
result BTC price history shows recurring events with similar duration and can be approximated using a Fibonacci sequence.

Let M be a Margulis spacetime whose associated complete hyperbolic surface S has compact convex core. Generalizing the correspondence between closed geodesics on M and closed geodesics on S, we establish an orbit equivalence between recurrent spacelike geodesics on M and recurrent geodesics on S. In contrast, no timeli…

2011-02-02abs ↗pdf ↗

Survey of deep learning applications in traffic congestion detection, prediction, and alleviation.

problem Improving transportation network service by detecting, predicting, and alleviating traffic congestion.
method Comprehensive review of deep learning applications in transportation, focusing on challenges specific to congestion.
result Identification of challenges and gaps in current research on deep learning for traffic congestion.

Personalizes query completion in digital commerce with image-based vectors.

problem High bounce rate and low recurring users in query completion.
method Injects dense vectors from product images into a noisy channel model.
result Image-based personalization improves query completion and user experience.

H-STGCN predicts traffic using navigation data and improves accuracy.

problem Limited accuracy in traffic forecasting due to lack of contextual information.
method Proposes H-STGCN, a hybrid spatio-temporal graph convolutional network.
result H-STGCN outperforms state-of-the-art methods in various metrics, especially for non-recurring congestion.

Study Morse functions on projective plane using Reeb graphs.

problem Investigate topological structure of Morse functions on projective plane.
method Use Reeb graphs to describe and prove properties of simple Morse functions on RP2\mathbb{R} P^2.
result Prove that Reeb graphs are a complete topological invariant for simple Morse functions on RP2\mathbb{R} P^2.

DoubleAdapt improves stock trend forecasting by adapting models to evolving data.

problem Incremental learning for stock trend forecasting is challenging due to distribution shifts.
method DoubleAdapt framework with two adapters for data and model adaptation.
result DoubleAdapt achieves state-of-the-art predictive performance on real-world stock datasets.

This overview paper is intended as a quick introduction to Lie algebras of vector fields. Originally introduced in the late 19th century by Sophus Lie to capture symmetries of ordinary differential equations, these algebras, or infinitesimal groups, are a recurring theme in 20th-century research on Lie algebras. I will…

2011-07-14abs ↗pdf ↗

Recurring international financial crises have adverse socioeconomic effects and demand novel regulatory instruments or strategies for risk management and market stabilization. However, the complex web of market interactions often impedes rational decisions that would absolutely minimize the risk. Here we show that, for…

2009-08-05abs ↗pdf ↗

Surveying machine learning for solving graph optimization problems.

problem Solving combinatorial optimization problems on graphs requires algorithmic engineering.
method Surveying machine learning approaches for graph optimization.
result Machine learning offers new ways to solve graph optimization problems.

A recurring problem when building probabilistic latent variable models is regularization and model selection, for instance, the choice of the dimensionality of the latent space. In the context of belief networks with latent variables, this problem has been adressed with Automatic Relevance Determination (ARD) employing…

2015-05-28abs ↗pdf ↗

A new memory system handles non-stationary environments by self-sizing and retaining memories.

problem Non-stationary environments where memories arrive over time and must be distinguished from noise.
method A self-sizing continual associative memory that generalizes Hopfield's network, handling adaptation and novelty.
result The memory system grows to the intrinsic memory demand of the environment and retains memories without forgetting.

We present a convex approach to probabilistic segmentation and modeling of time series data. Our approach builds upon recent advances in multivariate total variation regularization, and seeks to learn a separate set of parameters for the distribution over the observations at each time point, but with an additional pena…

2015-11-16abs ↗pdf ↗

I sketch a program for a microeconomic theory of the main component of the business cycle as a recurring disequilibrium, driven by incompleteness of the financial market and by information asymmetries between borrowers and lenders. This proposal seeks to incorporate five distinct but connected processes that have been …

2013-12-02abs ↗pdf ↗

Domain adaptation has become a prominent problem setting in machine learning and related fields. This review asks the question: how can a classifier learn from a source domain and generalize to a target domain? We present a categorization of approaches, divided into, what we refer to as, sample-based, feature-based and…

2019-01-16abs ↗pdf ↗

Super-resolution methods form high-resolution images from low-resolution images. In this paper, we develop a new Bayesian nonparametric model for super-resolution. Our method uses a beta-Bernoulli process to learn a set of recurring visual patterns, called dictionary elements, from the data. Because it is nonparametric…

2012-09-22abs ↗pdf ↗

LLMs struggle with financial reasoning but can outperform the market with human oversight.

problem Financial reasoning failures in LLM-generated stock market predictions.
method Evaluated four LLMs using three prompting strategies and compared to human oversight.
result LLMs require human oversight to fully realize their potential in financial markets.

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.

A recurring problem faced when training neural networks is that there is typically not enough data to maximize the generalization capability of deep neural networks(DNN). There are many techniques to address this, including data augmentation, dropout, and transfer learning. In this paper, we introduce an additional met…

2017-03-24abs ↗pdf ↗

Novel method uses information theory to measure causal influences during transient neural events.

problem Characterizing network interactions during transient neural events.
method Structural Causal Models, Information Theory, Transfer Entropy, Dynamic Causal Strength, Relative Dynamic Causal Strength.
result Introduced a novel measure, relative Dynamic Causal Strength, with theoretical and empirical support.

The scarcity of data annotated at the desired level of granularity is a recurring issue in many applications. Significant amounts of effort have been devoted to developing weakly supervised methods tailored to each individual setting, which are often carefully designed to take advantage of the particular properties of …

2015-09-22abs ↗pdf ↗

The design of good heuristics or approximation algorithms for NP-hard combinatorial optimization problems often requires significant specialized knowledge and trial-and-error. Can we automate this challenging, tedious process, and learn the algorithms instead? In many real-world applications, it is typically the case t…

2017-04-05abs ↗pdf ↗

ECBMs unify concept-based interpretations in deep learning models.

problem Suboptimal final accuracy and lack of concept interaction and conditional dependencies.
method ECBMs use a set of neural networks to define joint energy, enabling concept correction and conditional dependency quantification.
result ECBMs achieve higher accuracy and richer concept interpretations compared to state-of-the-art methods.

MCD offers a complete model understanding for high-stake decisions.

problem Local model understanding in XAI methods is not sufficient for high-stake decisions.
method MCD extends concept-based methods to ensure global model understanding via multi-dimensional subspaces.
result MCD provides a complete model understanding, ensuring the model reasoning is related to the actual model.

Is it possible to generally construct a dynamical system to simulate a black system without recovering the equations of motion of the latter? Here we show that this goal can be approached by a learning machine. Trained by a set of input-output responses or a segment of time series of a black system, a learning machine …

2017-07-24abs ↗pdf ↗

Concept-driven OPE reduces variance in off-policy decision evaluation.

problem High variance in off-policy decision evaluation due to limited sample sizes.
method Integrating human-explainable concepts into OPE to reduce variance.
result Concept-based OPE estimators remain unbiased and reduce variance when concepts are known and predefined.

DCR improves interpretability of concept-based models by using neural networks to build rule structures.

problem Inability of concept-based models to provide transparent decision processes.
method DCR uses neural networks to build syntactic rule structures using concept embeddings and executes these rules on concept truth degrees.
result DCR improves interpretability by up to 25% on challenging benchmarks and discovers meaningful logic rules.