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

Trend · papers per month

14274154 · Jun 202019922001200920172026
48 results for magnitude

Magnitude homology is a bigraded homology theory for finite graphs defined by Hepworth and Willerton, categorifying the power series invariant known as magnitude which was introduced by Leinster. We analyze the structure and implications of torsion in magnitude homology. We show that any finitely generated abelian grou…

2019-12-31abs ↗pdf ↗

Are expansions and recessions more likely to end as their magnitude increases? In this paper we apply parametric hazard models to investigate this issue in a sample of 16 countries from 1881 to 2000. For the total sample we find evidence of positive magnitude dependence for recessions, while for expansions we are not a…

2004-01-26abs ↗pdf ↗

Hepworth, Willerton, Leinster and Shulman introduced the magnitude homology groups for enriched categories, in particular, for metric spaces. The purpose of this paper is to describe the magnitude homology group of a metric space in terms of order complexes of posets. In a metric space, an interval (the set of points b…

2018-02-28abs ↗pdf ↗

Magnitude of geometric shapes studied for smooth manifolds, revealing spectral geometry insights.

problem Understanding the geometric significance of Leinster's magnitude for smooth manifolds.
method Investigation of magnitude function for various distance functions, including submanifolds and Riemannian manifolds, with asymptotic analysis in the limit.
result Magnitude function is well-defined and meromorphically continued for large distances, revealing volume, surface area, and curvature integrals.

A new method models financial returns by separating sign and magnitude, improving forecasting accuracy.

problem Capturing nonlinear predictability in financial return dynamics.
method Decomposes returns into sign and magnitude components, using a joint distribution model.
result Significantly outperforms traditional linear models in forecasting U.S. stock market returns.

Magnitude-based pruning is one of the simplest methods for pruning neural networks. Despite its simplicity, magnitude-based pruning and its variants demonstrated remarkable performances for pruning modern architectures. Based on the observation that magnitude-based pruning indeed minimizes the Frobenius distortion of a…

2020-02-12abs ↗pdf ↗

Magnitude is a real-valued invariant of metric spaces, analogous to the Euler characteristic of topological spaces and the cardinality of sets. The definition of magnitude is a special case of a general categorical definition that clarifies the analogies between various cardinality-like invariants in mathematics. Altho…

2010-12-29abs ↗pdf ↗

Novel metric space magnitude and weighting vectors improve machine learning tasks.

problem Improving machine learning algorithms using novel metric space concepts.
method Metric space magnitude and weighting vectors for better machine learning.
result The weighting vector effectively detects boundaries and improves classic machine learning tasks.

New measures quantify diversity of latent representations using metric space magnitude.

problem Evaluating the diversity of latent representations in machine learning models.
method Developed magnitude-based measures for latent representations, stable under data perturbations.
result Demonstrated superior performance across various domains and tasks.

Previous studies indicate that nonlinear properties of Gaussian time series with long-range correlations, uiu_i, can be detected and quantified by studying the correlations in the magnitude series ui|u_i|, i.e., the ``volatility''. However, the origin for this empirical observation still remains unclear, and the exact …

2004-06-14abs ↗pdf ↗

SPADE-S improves time series forecasting accuracy for low-magnitude and sparse data.

problem Challenges in forecasting time series with strong heterogeneity in magnitude and sparsity.
method SPADE-S is a robust forecasting architecture that reduces biases and improves overall prediction accuracy.
result SPADE-S outperforms existing state-of-the-art approaches across diverse use cases, improving forecast accuracy by up to 15%.

In this paper we define the magnitude of metric spaces using measures rather than finite subsets as had been done previously and show that this agrees with earlier work with Leinster in arXiv:0908.1582. An explicit formula for the magnitude of an n-sphere with its intrinsic metric is given. For an arbitrary homogeneous…

2010-05-21abs ↗pdf ↗

Neural networks have achieved dramatic improvements in recent years and depict the state-of-the-art methods for many real-world tasks nowadays. One drawback is, however, that many of these models are overparameterized, which makes them both computationally and memory intensive. Furthermore, overparameterization can als…

2019-12-10abs ↗pdf ↗

Our work connects parameter magnitudes and Hessian eigenspaces in deep neural nets.

problem Understanding the relationship between parameter magnitudes and Hessian curvature in deep learning models.
method Developed a matrix-free algorithm based on sketched SVDs to measure similarity between parameter masks and Hessian eigenspaces.
result Top Hessian eigenvectors tend to be concentrated around larger parameters, indicating a connection between parameter magnitudes and loss curvature.

This paper proposes an approach to the joint modeling of the short-time Fourier transform magnitude and phase spectrograms with a deep generative model. We assume that the magnitude follows a Gaussian distribution and the phase follows a von Mises distribution. To improve the consistency of the phase values in the time…

2019-03-08abs ↗pdf ↗

A new energy-efficient pruning method for federated learning.

problem Energy inefficiency in gradient sparsification for federated learning.
method Formalized energy-constrained projection problem and proposed Cost-Weighted Magnitude Pruning (CWMP).
result CWMP optimally balances performance and energy efficiency in federated learning.

This paper considers magnitude, asymptotics and duration of drawdowns for some Lévy processes. First, we revisit some existing results on the magnitude of drawdowns for spectrally negative Lévy processes using an approximation approach. For any spectrally negative Lévy process whose scale functions are well-behaved at …

2015-06-28abs ↗pdf ↗

New method identifies whether equity return predictability is due to magnitude shrinkage or directional reversal.

problem Determining the nature of equity return predictability (directional reversal vs magnitude shrinkage).
method Developed the Fourier-Residue Identity (FRI) to decompose return autocorrelation into sign and magnitude channels.
result The lag-1 autocorrelation in SPY is driven entirely by magnitude shrinkage, not directional reversal.

Distributed training of massive machine learning models, in particular deep neural networks, via Stochastic Gradient Descent (SGD) is becoming commonplace. Several families of communication-reduction methods, such as quantization, large-batch methods, and gradient sparsification, have been proposed. To date, gradient s…

2018-09-27abs ↗pdf ↗

Cosine similarity can force points to grow in magnitude, causing convergence issues.

problem Cosine similarity loss can lead to convergence issues in deep learning.
method Analyzing under-explored settings and proposing cut-initialization.
result Cosine similarity optimization forces points to grow in magnitude, leading to convergence issues.

We address noisy Euclidean distances in high dimensions, estimating noise levels and correcting distances.

problem Distorted pairwise Euclidean distances due to heteroskedastic noise.
method Developed a hyperparameter-free approach to jointly estimate noise magnitudes and correct distances.
result Our method provides accurate noise magnitude estimates and corrected distances in high-dimensional settings.

Predicting absolute magnitude of fluctuations of price, even if their sign remains unknown, is important for risk analysis and for option prices. In the present work, we display our predictions about absolute magnitude of daily fluctuations of the Dow Jones Industrials Average (DJIA), utilizing the original theory of c…

2006-02-08abs ↗pdf ↗

We propose a novel SPARsity and Clustering (SPARC) regularizer, which is a modified version of the previous octagonal shrinkage and clustering algorithm for regression (OSCAR), where, the proposed regularizer consists of a KK-sparse constraint and a pair-wise \ell_{\infty} norm restricted on the KK largest componen…

2013-10-18abs ↗pdf ↗

New algorithm robust to outliers in Bayesian Optimization.

problem Vulnerability of Bayesian Optimization to extreme outliers.
method Introduces a new adversary with a frequency-bounded corruption budget and derives RCGP-UCB algorithm.
result Achieves sublinear regret in the presence of up to O(T1/4)O(T^{1/4}) and O(T1/7)O(T^{1/7}) corruptions with possibly infinite magnitude.

The thesis explores IMP, a process that identifies winning tickets in DNNs, and its universality.

problem Understanding how winning subnetworks (tickets) perform across different problems.
method Iterative Magnitude Pruning (IMP) and comparison with Renormalisation Group (RG) theory.
result IMP identifies winning subnetworks that can perform similarly across various problems.

Hollow-tree Super resolves feature importance in large datasets.

problem Lack of effective scaling for large feature numbers in boosted tree models.
method Hollow-tree Super (HOTS) methodology for feature importance visualization.
result HOTS effectively resolves feature importance and directionality in high-dimensional neuroscientific data.

A new approach to the understanding of complex behavior of financial markets index using tools from thermodynamics and statistical physics is developed. Physical complexity, a magnitude rooted in Kolmogorov-Chaitin theory is applied to binary sequences built up from real time series of financial markets indexes. The st…

2001-04-24abs ↗pdf ↗

Low rank matrix factorisation is often used in recommender systems as a way of extracting latent features. When dealing with large and sparse datasets, traditional recommendation algorithms face the problem of acquiring large, unrestrained, fluctuating values over predictions especially for users/items with very few co…

2018-07-15abs ↗pdf ↗

A new approach to the understanding of the complex behavior of financial markets index using tools from thermodynamics and statistical physics is developed. Physical complexity, a magnitude rooted in the Kolmogorov-Chaitin theory is applied to binary sequences built up from real time series of financial markets indices…

2000-05-25abs ↗pdf ↗

Neural model outperforms ETAS in forecasting Central Apennines earthquakes.

problem Short-term seismicity forecasting with incomplete data.
method Extended a neural network model to the magnitude domain, using it to forecast earthquakes above a target magnitude threshold.
result Neural model outperforms ETAS at lower magnitude thresholds, due to its robustness to missing data.