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.
Learnable multiclass hypothesis classes don't always have a sample compression scheme of fixed size.
Fewer obstructions for small graphs in knotless embedding.
We consider the roughness properties of NYSE (New York Stock Exchange) stock-price fluctuations. The statistical properties of the data are relatively homogeneous within the same day but the large jumps between different days prevent the extension of the analysis to large times. This leads to intrinsic finite size effe…
We study the finite-size effects in some scaling systems, and show that the finite number of agents N leads to a cut-off in the upper value of the Pareto law for the relative individual wealth. The exponent of the Pareto law obtained in stochastic multiplicative market models is crucially affected by the fact that …
Study non-monotonic loss functions in CRC, achieving valid risk control with large calibration samples.
The Normalized Mutual Information (NMI) has been widely used to evaluate the accuracy of community detection algorithms. However in this article we show that the NMI is seriously affected by systematic errors due to finite size of networks, and may give a wrong estimate of performance of algorithms in some cases. We gi…
Finite element method applied to Leland's model for option pricing with transaction costs.
In the information-based paradigm of inference, model selection is performed by selecting the candidate model with the best estimated predictive performance. The success of this approach depends on the accuracy of the estimate of the predictive complexity. In the large-sample-size limit of a regular model, the predicti…
The paper characterizes simply connected quandles using cocycles with prime values.
Study 2-complexes' homology properties and torsion growth.
A neural network model predicts the critical point of the Ising phase transition.
The study reveals a transition in neural network performance from infinite-width to variance-limited behavior as dataset size increases.
Improved variance reduction for Riemannian non-convex optimization with adaptive batch size.
New method reduces over-parametrization in neural networks, ensuring sparsity and finite network size.
Policy gradient methods achieve linear convergence in simple MDPs.
We derive a lower bound on the size of finite non-cyclic quotients of the braid group that is superexponential in the number of strands. We also derive a similar lower bound for nontrivial finite quotients of the commutator subgroup of the braid group.
We investigate finite-time decoupled convergence in nonlinear two-time-scale stochastic approximation.
The paper improves methods for estimating set size using samples.
We study the sample complexity of private synthetic data generation over an unbounded sized class of statistical queries, and show that any class that is privately proper PAC learnable admits a private synthetic data generator (perhaps non-efficient). Previous work on synthetic data generators focused on the case that …
Field theory explains optimal scaling in ResNets for signal propagation.
Estimates neural representation dimensionality from small sample sizes.
We consider the dynamics of a linear stochastic approximation algorithm driven by Markovian noise, and derive finite-time bounds on the moments of the error, i.e., deviation of the output of the algorithm from the equilibrium point of an associated ordinary differential equation (ODE). We obtain finite-time bounds on t…
Study shows finite agent equilibrium converges to mean-field limit in asset pricing.
Privacy affects how much data is needed for CVaR optimization.
This study analyzes LTS in sparse models with finite sample error bounds.
We determine the distribution of size and growthrates of German business firms in 1987-1997. We find a log-normal size distribution. The distribution of growth rates has fat tails. It can be fitted to an exponential in a narrow central region and is dominated by finite-sample-size effects far in its wings. We study the…
How big is the risk that a few initial failures of nodes in a network amplify to large cascades that span a substantial share of all nodes? Predicting the final cascade size is critical to ensure the functioning of a system as a whole. Yet, this task is hampered by uncertain or changing parameters and missing informati…
The Levy-Levy-Solomon model (A microscopic model of the stock market: cycles, booms, and crashes, Economic Letters 45 (1))is one of the most influential agent-based economic market models. In several publications this model has been discussed and analyzed. Especially Lux and Zschischang (Some new results on the Levy, L…
Let G be the identity component of SO(n,1), acting linearly on a finite dimensional real vector space V. Consider a vector w_0 in V such that the stabilizer of w_0 is a symmetric subgroup of G or the stabilizer of the line Rw_0 is a parabolic subgroup of G. For any non-elementary discrete subgroup Gamma of G with w_0Ga…
We prove (without using Federer's structure theorem) that a finite-mass flat chain over any coefficient group is rectifiable if and only if almost all of its 0-dimensional slices are rectifiable. This implies that every flat chain of finite mass and finite size is rectifiable. It also leads to a simple necessary and su…
Motivated by their broad applications in reinforcement learning, we study the linear two-time-scale stochastic approximation, an iterative method using two different step sizes for finding the solutions of a system of two equations. Our main focus is to characterize the finite-time complexity of this method under time-…
New TD method stabilizes average-reward learning.
Study bounds variance modulation function for K-spider distributions.
Kurtosis is seen as a measure of the discrepancy between the observed data and a Gaussian distribution and is defined when the 4th moment is finite. In this work an empirical study is conducted to investigate the behaviour of the sample estimate of kurtosis with respect to sample size and the tail index when applied to…
The paper analyzes the expected size of conformal prediction sets.
Develops a simple model to understand learning curves for arbitrary power laws.
Exact distribution of split conformal prediction coverage found.
It was proved in 1998 by Ben-David and Litman that a concept space has a sample compression scheme of size d if and only if every finite subspace has a sample compression scheme of size d. In the compactness theorem, measurability of the hypotheses of the created sample compression scheme is not guaranteed; at the same…
Deep learning method improves regression accuracy.
Functorial semi-norms on singular homology give refined "size" information on singular homology classes. A fundamental example is the l^1-semi-norm. We show that there exist finite functorial semi-norms on singular homology that are exotic in the sense that they are not carried by the l^1-semi-norm.
In this paper, we consider multi-agent learning via online gradient descent in a class of games called -cocoercive games, a fairly broad class of games that admits many Nash equilibria and that properly includes unconstrained strongly monotone games. We characterize the finite-time last-iterate convergence rate for …
Proposes SVI for covariate-shift generalization with sparse variable independence.
The paper explores properties of continuous actions on manifolds, proving bounds on subgroup size and fixed points.
Stochastic gradient descent (SGD) is almost ubiquitously used for training non-convex optimization tasks. Recently, a hypothesis proposed by Keskar et al. [2017] that large batch methods tend to converge to sharp minimizers has received increasing attention. We theoretically justify this hypothesis by providing new pro…
New theorem bounds group quotient size to subgroups index.
This work introduces COLA, a strategy to aggregate conformal prediction sets efficiently.
This manuscript studies statistical properties of linear classifiers obtained through minimization of an unregularized convex risk over a finite sample. Although the results are explicitly finite-dimensional, inputs may be passed through feature maps; in this way, in addition to treating the consistency of logistic reg…
We present a plausible micro-founded model for the previously postulated power law finite time singular form of the crash hazard rate in the Johansen-Ledoit-Sornette model of rational expectation bubbles. The model is based on a percolation picture of the network of traders and the concept that clusters of connected tr…