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

316192122 · May 202619922001200920172026
48 results for zeros accumulation

Jones polynomials for knots and links with many crossings calculated efficiently.

problem Computing Jones polynomials for knots and links with a large number of crossings.
method Calculating Tutte polynomials for associated graphs and evaluating with specific substitutions.
result Jones polynomials for knots and links with many crossings calculated efficiently.

ZeroS improves Transformers by adding negative weights, matching or beating softmax attention.

problem Limited performance of linear attention methods, especially in long context sequences.
method Proposes Zero-Sum Linear Attention (ZeroS) that removes the zero-order term and reweights zero-sum softmax residuals.
result ZeroS matches or exceeds standard softmax attention across various benchmarks, theoretically expanding representable functions.

Study confirms boundedness of certain singularities in log Fano geometry.

problem Boundedness of log Fano cone singularities and minimal log discrepancies.
method Analyzing local volumes and minimal log discrepancies of Kollár components.
result Boundedness of K-semistable log Fano cone singularities confirmed in dimension three.

Proves boundedness of log Fano cone singularities with bounded local volumes.

problem Understanding the boundedness of log Fano cone singularities.
method Analyzes K-semistable log Fano cone singularities with bounded volumes.
result The set of local volumes of klt singularities has zero as the only accumulation point.

Improves matrix multiplication throughput for asymmetric bit-width operands.

problem Matrix multiplications between asymmetric bit-width operands, especially 8- and 4-bit, are not efficiently handled by existing SIMD instructions.
method Proposes a new SIMD matrix multiplication instruction that uses mixed precision on inputs (8- and 4-bit) and accumulates into 16-bit output, improving throughput.
result Offers 2x improvement in throughput compared to existing symmetric-operand-size instructions, with negligible overflow.

The paper addresses score-mismatched diffusion models and zero-shot conditional samplers.

problem Theoretical guarantees for score-mismatched diffusion models in zero-shot conditional sampling.
method Theoretical analysis of score-mismatched diffusion models and zero-shot conditional samplers.
result Theoretical performance guarantees with explicit dimensional dependencies for score-mismatched diffusion samplers.

In this paper we consider SU(2)\rm SU(2) monopoles on an asymptotically conical, oriented, Riemannian 33-manifold with one end. The connected components of the moduli space of monopoles in this setting are labeled by an integer called the charge. We analyse the limiting behavior of sequences of monopoles with fixed charg…

2018-03-12abs ↗pdf ↗

New data accumulation prevents model collapse in generative models.

problem Model collapse in generative models trained on their own outputs.
method Empirical study of language models, diffusion models, and variational autoencoders; analytically tractable framework for linear models.
result Accumulating synthetic data alongside real data avoids model collapse, preventing performance degradation.

Wealth inequality is an important matter for economic theory and policy. Ongoing debates have been discussing recent rise in wealth inequality in connection with recent development of active financial markets around the world. Existing literature on wealth distribution connects the origins of wealth inequality with a v…

2018-09-23abs ↗pdf ↗

Our study shows that many firms would accumulate at zero output level (namely, Bankruptcy status) if a perfectly competitive market reaches full employment (namely, those people who should obtain employment have obtained employment). As a result, appearance of economic crisis is determined by two points; that is, (a). …

2010-10-22abs ↗pdf ↗

Study of historic stock returns distributions, highlighting asymmetry and outliers.

problem Understanding the asymmetry in accumulated gains and losses in stock returns over time.
method Analyzing decades-long historic distributions of S&P500 returns, comparing gains and losses, using statistical U-tests and fitting log-log scale linearly.
result The mean of de-trended distributions increases linearly with the number of days of accumulation, and the overall skew is negative, indicating heavier tails of losses.

In this paper, finite type domains with hyperbolic orbit accumulation points are studied. We prove, in case of C2\mathbb{C}^2, it has to be a (global) pseudoconvex domain, after an assumption of boundary regularity. Moreover, one of the applications will realize the classification of domains within this class, precisel…

2013-04-30abs ↗pdf ↗

Analyzes multi-day stock returns, showing linear volatility and mean dependence.

problem Linear dependence of volatility and mean in accumulated stock returns.
method Modified Jones-Faddy skew t-distribution analysis.
result Linear dependence of volatility and mean on the number of days of accumulation.

The paper models financial markets and real economy interactions using a large agent framework.

problem Understanding capital allocation and accumulation in financial markets and real economy interactions.
method Developed a field-formalism model to analyze interactions between financial markets and real economy with a large number of heterogeneous agents.
result The number of firms in each sector depends on the aggregate financial capital invested and expected long-term returns.

Study analyzes symmetric two-armed Bernoulli bandit problem with zero mean gap.

problem Analyzing symmetric two-armed Bernoulli bandit problem with zero mean gap.
method Associated with a solution of a linear heat equation, compute leading order terms of minmax optimal regret and pseudoregret.
result Explicitly compute leading order terms in three scaling regimes for the gap.

This paper presents a model of capital accumulation for a large number of heterogenous producer-consumers in an exchange space in which interactions depend on agents' positions. Each agent is described by his production, consumption, stock of capital, as well as the position he occupies in this abstract space. Each age…

2019-09-09abs ↗pdf ↗

WrapNet optimizes inference for low-resolution neural networks by using 8-bit additions.

problem Reducing multiplication complexity in low-resolution neural networks.
method Adapting neural networks to use low-resolution (8-bit) additions in accumulators, with a cyclic activation layer and overflow penalty regularizer.
result Achieves comparable classification accuracy to 32-bit counterparts using low-resolution additions.

Improves likelihood-free inference by using a new sampling approach to avoid biased data collection.

problem Efficient Bayesian inference without likelihood evaluation for real-world datasets.
method Introduces Neural Proposal (NP) to sample simulation inputs i.i.d. for unbiased posterior inference.
result Demonstrates improved performance, especially for multi-modal posteriors, through experiments.

Consider an American option that pays G(X^*_t) when exercised at time t, where G is a positive increasing function, X^*_t := \sup_{s\le t}X_s, and X_s is the price of the underlying security at time s. Assuming zero interest rates, we show that the seller of this option can hedge his position by trading in the underlyi…

2011-08-20abs ↗pdf ↗

For any nonorientable closed surface, we determine the minimal dilatation among pseudo-Anosov mapping classes arising from Penner's construction. We deduce that the sequence of minimal Penner dilatations has exactly two accumulation points, in contrast to the case of orientable surfaces where there is only one accumula…

2018-07-24abs ↗pdf ↗

In many large-scale machine learning applications, data are accumulated with time, and thus, an appropriate model should be able to update in an online paradigm. Moreover, as the whole data volume is unknown when constructing the model, it is desired to scan each data item only once with a storage independent with the …

2017-06-08abs ↗pdf ↗

Standard models in economics stress the role of intelligent agents who maximize utility. However, there may be situations where, for some purposes, constraints imposed by market institutions dominate intelligent agent behavior. We use data from the London Stock Exchange to test a simple model in which zero intelligence…

2003-09-09abs ↗pdf ↗

Paper excludes the lowest energy level as an accumulation point for harmonic maps into analytic manifolds.

problem Analytic manifolds and their harmonic maps energy spectrum.
method Exclusion of the lowest energy level as an accumulation point using obstructions to the gluing of harmonic spheres and Lojasiewicz-estimates.
result Proves that the lowest energy level is not an accumulation point for generic 3-manifolds.

The aim of the present article is to offer a strictly mathematical, statistical treatment of the current account balances in EU and in the Eurozone. Based on Eurostat data, an overview of the total and annual balances is first made for different collections among the EU countries. Then, using the Mathematica technical …

2013-02-19abs ↗pdf ↗

We consider a family of manifolds with a class of degenerating warped product metrics gε=ρ(ε,t)2adt2+ρ(ε,t)2bdsM2g_ε=ρ(ε,t)^{2a}dt^2 +ρ(ε,t)^{2b}ds_M^2, with MM compact, ρρ homogeneous degree one, a1a \le -1 and b>0b > 0. We study the Laplace operator acting on L2L^{2} differential pp-forms and give sharp accumulation rates for eigenvalues n…

2003-11-14abs ↗pdf ↗

In this paper we consider sparse approximation problems, that is, general l0l_0 minimization problems with the l0l_0-"norm" of a vector being a part of constraints or objective function. In particular, we first study the first-order optimality conditions for these problems. We then propose penalty decomposition (PD) me…

2012-05-10abs ↗pdf ↗

AdaX improves Adam by exponentially accumulating past gradients, leading to better performance in machine learning tasks.

problem Adam's fast convergence can lead to local minimums in non-convex problems.
method AdaX exponentially accumulates past gradients to adaptively tune the learning rate.
result AdaX outperforms Adam in various machine learning tasks, including computer vision and natural language processing.

FetchSGD reduces communication in federated learning with sketching.

problem Communication bottlenecks and convergence issues in federated learning.
method FetchSGD uses Count Sketch to compress and merge model updates efficiently.
result FetchSGD achieves high compression rates and good convergence without sparse client participation.