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

Trend · papers per month

16324763 · May 202619922001200920172026
48 results for stock counts

Study finds inventory inaccuracies are linked to store activity and product perishability.

problem Inventory record inaccuracy in grocery retailing environments.
method Analysis of 24,000 SKUs across 11 stores, field quasi-experiment on audits.
result Inventory audits can boost sales by 11%, especially for perishable items.

What return should you expect when you take on a given amount of risk? How should that return depend upon other people's behavior? What principles can you use to answer these questions? In this paper, we approach these topics by exploring the consequences of two simple hypotheses about risk. The first is a common-sense…

2002-01-18abs ↗pdf ↗

Detailed study of multifractal characteristics of the financial time series of asset values and of its returns is performed using a collection of the high frequency Deutsche Aktienindex data. The tail index (αα), the Renyi exponents based on the box counting algorithm for the graph (dqd_q) and the generalized Hurst ex…

2002-05-23abs ↗pdf ↗

Study examines how BRICS nations' economies respond to COVID-19.

problem Impact of COVID-19 on BRICS nations' economic indicators.
method Structural variable autoregression (SVAR) to analyze growth, exchange rate, and stock market data.
result COVID-19 shock to exchange rate growth persists for 10+ days, stock market growth for 15 days.

Paper tests for time-varying entropy in stock prices, finding periods of inefficiency.

problem Testing for time-varying entropy in stock price dynamics.
method Unbiased approximation of Shannon entropy variance, optimal rolling window selection, hypothesis testing.
result Existence of periods of market inefficiency for meme stocks.

The statistical properties of the bid-ask spread of a frequently traded Chinese stock listed on the Shenzhen Stock Exchange are investigated using the limit-order book data. Three different definitions of spread are considered based on the time right before transactions, the time whenever the highest buying price or th…

2006-12-31abs ↗pdf ↗

Flow Matching for count data improves sample quality and efficiency.

problem Mapping between count distributions across batches or time points in high-dimensional count data.
method count-FM, a flow-matching framework based on a continuous-time birth-death process with local unit jumps.
result count-FM achieves better sample quality than representative baselines while using fewer parameters.

New algorithms handle unpredictable actions in sequential learning.

problem Learning with unreliable composite actions in online optimization.
method Follow-The-Perturbed-Leader method with Counting Asleep Times loss estimation.
result Significant improvement in performance guarantees for sleeping bandit problem.

A new method, Count-MORL, improves offline reinforcement learning by using state-action frequency.

problem Improving offline reinforcement learning performance.
method Integrates count-based conservatism into model-based offline reinforcement learning.
result The learned policy is near-optimal and outperforms existing methods.

Proposes a method to reconcile count time series forecasts.

problem No formal framework for probabilistic reconciliation of count time series.
method Generalizes Bayes' rule for reconciling real-valued and count variables.
result Improves forecast accuracy for count variables compared to Gaussian reconciliation.

Graph neural networks struggle with counting certain substructures in graphs.

problem Detecting and counting specific substructures in graphs.
method Study of graph neural networks' ability to count attributed graph substructures.
result Graph neural networks like MPNNs, 2-WL, and 2-IGNs have limitations in counting certain substructures.

The conventional formal tool to detect effects of the financial persistence is in terms of the Hurst exponent. A typical corresponding result is that its value comes out close to 0.5, as characteristic for geometric Brownian motion, with at most small departures from this value in either direction depending on the mark…

2005-04-22abs ↗pdf ↗

The paper proposes count echo state networks for forecasting graduate student enrollments.

problem Forecasting graduate student enrollments from historical data.
method Developed hierarchical count echo state networks and compared them to Poisson autoregressions and negative binomial models.
result Hierarchical negative binomial based echo state network is the superior model.

Counted essential surfaces in a knot's exterior, finding a unique pattern.

problem Counting essential surfaces in a knot's exterior.
method Counted essential surfaces by genus, using Euler totient function. Showed normal surfaces are connected by counting their components. Used Agol, Hass, and Thurston's tools to convert component counting into orbit counting.
result Found a unique pattern in the number of essential surfaces by genus.

Counting objects in digital images is a process that should be replaced by machines. This tedious task is time consuming and prone to errors due to fatigue of human annotators. The goal is to have a system that takes as input an image and returns a count of the objects inside and justification for the prediction in the…

2017-03-25abs ↗pdf ↗

Better neural arithmetic logic units improve cell counting model generalization.

problem Neural networks struggle with high cell counts outside training data range.
method Introduced Neural Arithmetic Logic Units (NALU) for arithmetic operations in existing architectures.
result Improved cell counting accuracy for higher numeric ranges with better generalization.

Estimates point counts in Teichmüller space for mapping class groups.

problem Counting points in Teichmüller space under mapping class group actions.
method Quantitative estimates with power saving error terms for Teichmüller metric balls.
result Effectivizes asymptotic counting results of Athreya et al.

Proves quaternionic analog of Cartan's theorem and counts arithmetic chains.

problem Understanding transformations of quaternionic hyperbolic spaces.
method Analyzes chain-preserving transformations and arithmetic chains in quaternionic Heisenberg group.
result Proves analog of Cartan's theorem and provides counting and equidistribution results.

Counting is a fundamental task in biomedical imaging and count is an important biomarker in a number of conditions. Estimating the uncertainty in the measurement is thus vital to making definite, informed conclusions. In this paper, we first compare a range of existing methods to perform counting in medical imaging and…

2019-07-25abs ↗pdf ↗

Count data take on non-negative integer values and are challenging to properly analyze using standard linear-Gaussian methods such as linear regression and principal components analysis. Generalized linear models enable direct modeling of counts in a regression context using distributions such as the Poisson and negati…

2020-01-10abs ↗pdf ↗

Study shows how to count and equidistribute cusped Hitchin representations with entropy gaps.

problem Counting and equidistribution of cusped Hitchin representations.
method Renewal theorem of Kesseböhmer and Kombrink applied to count and equidistribute.
result Entropy gaps at infinity allow for counting and equidistribution results.

Graphlets are defined as k-node connected induced subgraph patterns. For an undirected graph, 3-node graphlets include close triangle and open triangle. When k = 4, there are six types of graphlets, e.g., tailed-triangle and clique are two possible 4-node graphlets. The number of each graphlet, called graphlet count, i…

2018-10-07abs ↗pdf ↗

The involutory birack counting invariant is an integer-valued invariant of unoriented tangles defined by counting homomorphisms from the fundamental involutory birack of the tangle to a finite involutory birack over a set of framings modulo the birack rank of the labeling birack. In this first of an anticipated series …

2012-08-16abs ↗pdf ↗

Variational Bayesian inference and (collapsed) Gibbs sampling are the two important classes of inference algorithms for Bayesian networks. Both have their advantages and disadvantages: collapsed Gibbs sampling is unbiased but is also inefficient for large count values and requires averaging over many samples to reduce …

2012-06-13abs ↗pdf ↗

We propose scalable methods to execute counting queries in machine learning applications. To achieve memory and computational efficiency, we abstract counting queries and their context such that the counts can be aggregated as a stream. We demonstrate performance and scalability of the resulting approach on random quer…

2018-04-12abs ↗pdf ↗

A gamma process dynamic Poisson factor analysis model is proposed to factorize a dynamic count matrix, whose columns are sequentially observed count vectors. The model builds a novel Markov chain that sends the latent gamma random variables at time (t1)(t-1) as the shape parameters of those at time tt, which are linked …

2015-12-30abs ↗pdf ↗

We consider involutory virtual biracks with good involutions, also known as symmetric involutory virtual biracks. Any good involution on an involutory virtual birack defines an enhancement of the counting invariant. We provide examples demonstrating that the enhancement is stronger than the unenhanced counting invarian…

2014-10-16abs ↗pdf ↗

We consider an agent's uncertainty about its environment and the problem of generalizing this uncertainty across observations. Specifically, we focus on the problem of exploration in non-tabular reinforcement learning. Drawing inspiration from the intrinsic motivation literature, we use density models to measure uncert…

2016-06-06abs ↗pdf ↗

The paper counts mapping classes by Nielsen-Thurston type, finding growth rates for different subsets.

problem Counting mapping classes in Teichmüller space with different subsets.
method Introduced complexity length to measure negative curvature of curve complexes.
result Growth rates for finite-order, reducible, and multitwists subsets.