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

6.3%12.5%18.8%25.0% · Apr 199319922001200920172026
48 results for universal average

New analysis shows halting time is predictable for large models, improving optimization efficiency.

problem Understanding the average-case complexity of optimization algorithms for large-scale models.
method Average-case analysis of first-order methods on random least squares and neural networks.
result Halting time is independent of input distribution, leading to tighter convergence rates.

Consider a family of portfolio strategies with the aim of achieving the asymptotic growth rate of the best one. The idea behind Cover's universal portfolio is to build a wealth-weighted average which can be viewed as a buy-and-hold portfolio of portfolios. When an optimal portfolio exists, the wealth-weighted average c…

2015-10-09abs ↗pdf ↗

We compute the rational cohomology of the universal family of smooth cubic surfaces using Vassiliev's method of simplicial resolution. Modulo embedding, the universal family has cohomology isomorphic to that of P2\mathbb{P}^2. A consequence of our theorem is that over the finite field Fq\mathbb{F}_q, away from finitely…

2019-02-02abs ↗pdf ↗

Under-parameterized networks can either copy or average teacher weights, leading to universal optimal solutions.

problem Approximating a teacher network with an under-parameterized student network.
method Analyzing shallow neural networks with erf activation function and unitary teacher weights, proving copy-average configurations are critical points and finding the optimal solution.
result The optimal solution for under-parameterized networks has a universal structure, whether copying or averaging teacher neurons.

We analyze the constituents stocks of the Dow Jones Industrial Average (DJIA30) and the Standard & Poor's 100 index (S&P100) of the NYSE stock exchange market. Surprisingly, we discover the data collapse of the histograms of the DJIA30 price fluctuations and of the S&P100 price fluctuations to the universal non-paramet…

2008-10-14abs ↗pdf ↗

Frame Averaging makes neural networks invariant or equivariant to new symmetries.

problem Designing neural networks that respect symmetries while being expressive and efficient.
method Introduces Frame Averaging (FA) as a systematic framework to adapt architectures to become invariant or equivariant to new symmetries.
result Frame Averaging guarantees exact invariance or equivariance while being simpler to compute than full group averaging.

A new approach to continuous-time universal portfolios using pathwise Itô calculus.

problem Continuous-time version of Cover's universal portfolio strategies.
method Pathwise Itô calculus approach to establish existence and properties of universal portfolio strategies.
result The universal portfolio strategy's portfolio value process is the average of all values of constant rebalanced strategies.

Novel approach to universal online learning for bounded losses, closing open problems.

problem Characterizing processes for universal online learning under non-i.i.d. conditions.
method Characterization of processes admitting strong and weak universal learning, introduction of optimistically universal learning rule.
result Introduction of a novel 1NN algorithm that is optimistically universal for bounded losses.

Solves open problem on universally consistent online learning with unbounded losses.

problem Open problem on universally consistent online learning with unbounded losses.
method Constructs random measurable partitions of the instance space.
result Simple memorization rule is optimistically universal for any unbounded loss.

This note provides a neat and enjoyable expansion and application of the magnificent Ordentlich-Cover theory of "universal portfolios." I generalize Cover's benchmark of the best constant-rebalanced portfolio (or 1-linear trading strategy) in hindsight by considering the best bilinear trading strategy determined in hin…

2019-07-23abs ↗pdf ↗

Improved algorithm speeds up generation of universal adversarial perturbations.

problem Slow generation of universal adversarial perturbations.
method Optimized algorithm based on orientation of perturbation vectors.
result Significantly faster generation of universal perturbations with higher fooling rates.

UTOPIA aggregates multiple prediction intervals efficiently.

problem Constructing optimal prediction intervals for various real-world data problems.
method UTOPIA is a universally trainable strategy using linear or convex programming.
result UTOPIA constructs prediction intervals with small average width and high coverage probability.

Generalizes causal inference to high-dimensional outcomes.

problem Limited causal inference methods for multivariate outcomes.
method Formulates causal discrepancy tests for nominal variables, uses conditional independence tests.
result Causal CDcorr method improves finite sample validity and power.

Study evaluates the impact of academic support center's face-to-face assistance on student performance.

problem Underestimation of Academic Support Center's true impact due to group bias.
method Applied causal inference theory and T-learner to evaluate conditional average treatment effect (CATE) of F2F personal assistance.
result Developed a new CATE function that depends on the number of F2F sessions, predicting improved CATE performance.

We study power-law correlations properties of the Google search queries for Dow Jones Industrial Average (DJIA) component stocks. Examining the daily data of the searched terms with a combination of the rescaled range and rescaled variance tests together with the detrended fluctuation analysis, we show that the searche…

2015-02-01abs ↗pdf ↗

The universe's shape and size are determined in general cosmological models.

problem Determining the shape and size of the universe in general cosmological models.
method Using differential geometry and extensions of the Bonnet-Myers theorem, the researchers derived conditions for a finite universe and provided a list of possible topologies.
result The spatial sections of the universe can be either S1imesS2S^1 imes S^2, S1ildeimesS2S^1 ilde{ imes}S^2, S1imesRP2S^1 imes\mathbb{RP}^2, RP3#RP3\mathbb{RP}^3 \# \mathbb{RP}^3, or covered by the sphere S3S^3 or torus T3T^3.

This paper explores the limits of deep learning in poly-time.

problem Characterizing function distributions that deep learning can or cannot learn efficiently.
method Analysis of SGD and GD-based deep learning approaches, proving universality and non-universality results.
result SGD-based deep learning is efficiently universal, while GD-based is not, especially with large batches.

Study confirms the square-root law in price impact across Tokyo stocks.

problem The debate on the strict universality of the square-root law in price impact.
method Comprehensive survey of all trading accounts on the Tokyo Stock Exchange over 8 years.
result The exponent δ is equal to 1/2 for all stocks within statistical errors.

We conclude from an analysis of high resolution NYSE data that the distribution of the traded value fif_i (or volume) has a finite variance σiσ_i for the very large majority of stocks ii, and the distribution itself is non-universal across stocks. The Hurst exponent of the same time series displays a crossover from we…

2006-08-02abs ↗pdf ↗

New averaging technique speeds up Newton method convergence.

problem Superlinear convergence of stochastic Newton methods with noisy Hessians.
method Hessian averaging to reduce noise and maintain superlinear convergence.
result Hessian averaging achieves superlinear convergence with a non-asymptotic rate.

No universal trading strategy exists due to mathematical impossibilities.

problem The impossibility of universally winning trading strategies in competitive markets.
method Three mathematical paradigms: measure-theoretic, No-Free-Lunch theorem, and adversarial Cantor diagonalization.
result No-arbitrage and free-lunch principles are mathematically precluded in competitive markets.

Diversified risk parity strategies outperform equally-weighted portfolios in various asset universes.

problem Finding optimal portfolio allocations that balance risk and reward.
method Integrates various reward-risk measures and generic allocation rules into diversified risk parity.
result Diversified reward-risk parity strategies exhibit higher average returns, Sharpe ratios, and Calmar ratios compared to equally-weighted risk portfolios.

Max-margin classifiers' behavior is studied in high dimensions with non-Gaussian features.

problem Understanding the role of featurization maps and high-dimensional misclassification error.
method High-dimensional asymptotics, Gaussian model, support vector representation.
result Asymptotic behavior of max-margin classifiers is determined by feature covariance and label covariance.

How many bits of information are revealed by a learning algorithm for a concept class of VC-dimension dd? Previous works have shown that even for d=1d=1 the amount of information may be unbounded (tend to \infty with the universe size). Can it be that all concepts in the class require leaking a large amount of inform…

2018-11-25abs ↗pdf ↗

Study on stochastic approximation with Polyak-Ruppert averaging for linear systems.

problem Understanding the asymptotic and non-asymptotic properties of stochastic approximation procedures.
method Detailed analysis of linear stochastic approximation with Polyak-Ruppert averaging, focusing on asymptotic and non-asymptotic properties.
result Proves CLT and non-asymptotic concentration inequality for averaged iterates, providing refined understanding of linear stochastic approximation.

New insights into bias mitigation show DRO isn't a complete solution.

problem Bias in machine learning systems across different data subsets.
method Theoretical analysis of Distributionally Robust Optimization (DRO) and data curation.
result Neither DRO nor data curation alone can fully address bias issues.

The study examines averages of Laplacian determinants over large genus moduli spaces.

problem Analyzing averages of determinants of Laplacians over large genus moduli spaces.
method Examined the moduli space of hyperbolic surfaces with the Weil-Petersson metric, showing decay rates and approaching constants for specific functions.
result Found a universal constant E and decay rates for expected values of determinants over large genus moduli spaces.

We study geodesics on the modular surface, comparing WP and hyperbolic metrics.

problem Comparing geodesics on the modular surface under different metrics.
method Lift WP geodesics to the universal cover, analyze geometric properties, and compare deviations.
result WP and hyperbolic geodesics fellow-travel in the thick part of the universal cover.