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

163327490653 · Jun 202019922001200920172026
48 results for structured scaling

We define the intrinsic scale at which a network begins to reveal its identity as the scale at which subgraphs in the network (created by a random walk) are distinguishable from similar sized subgraphs in a perturbed copy of the network. We conduct an extensive study of intrinsic scale for several networks, ranging fro…

2019-01-15abs ↗pdf ↗

We study the concept of coarse disjointness and large scale nn-to-11 functions. As a byproduct, we obtain an Ostrand-type characterization of asymptotic dimension for coarse structures. It is shown that properties like finite asymptotic dimension, coarse finitism, large scale weak paracompactness, ect. are all invari…

2015-08-12abs ↗pdf ↗

The paper discusses reducing Hamiltonian systems by scaling and standard symmetries, leading to Kirillov Hamiltonian systems.

problem Reduction of symplectic Hamiltonian systems by scaling and standard symmetries.
method Proof of Kirillov Hamiltonian systems and equivalence of reductions.
result Equivalent Kirillov Hamiltonian systems from different reduction orders.

StrTransformer recovers sources without labels by optimizing latent matrices and enforcing structural constraints.

problem Unsupervised blind source recovery in signal processing.
method Source-wise structured Transformer framework with latent source matrix optimization, structural regularization, and branch-specific weights.
result StrTransformer learns distinct temporal-scale structures and recovers source-aligned latent trajectories.

Uniformity and proximity are two different ways for defining small scale structures on a set. Coarse structures are large scale counterparts of uniform structures. In this paper, motivated by the definition of proximity, we develop the concept of asymptotic resemblance as a relation between subsets of a set to define a…

2013-10-23abs ↗pdf ↗

This work explores variably scaled kernels to improve non-stationary Gaussian processes.

problem Limited ability of stationary kernels to represent heterogeneous correlation structures.
method Introduces variably scaled kernels to modify correlation structures explicitly.
result Improved reconstruction accuracy and better uncertainty estimates for non-stationary data.

This study examines cores within superclusters, highlighting their transitional nature and dynamical state.

problem Understanding the morphology and dynamical properties of cores within superclusters.
method Projected and radial velocity distributions of galaxies, morphological analysis, entropy and mass estimates.
result Cores are transitional structures that evolve towards virialisation but remain gravitationally bound.

We uncover scaling laws and statistical structure in complex datasets.

problem Understanding universal traits in complex datasets.
method Analogizing data to physical systems, using statistical physics and RMT.
result Real-world datasets and Gaussian data with long-range correlations share the same RMT universality class.

New method approximates controllability of large networks from coarse summaries.

problem Controlling large-scale linear dynamical systems with incomplete network information.
method Algorithm using stochastic block model to estimate controllability from coarse summaries.
result Average controllability of fine-scale system can be well approximated by coarse-scale system.

Recent advancements in recurrent neural network (RNN) research have demonstrated the superiority of utilizing multiscale structures in learning temporal representations of time series. Currently, most of multiscale RNNs use fixed scales, which do not comply with the nature of dynamical temporal patterns among sequences…

2019-02-15abs ↗pdf ↗

Behaviors of several laboratory animals can be modeled as sequences of stereotyped behaviors, or behavioral motifs. However, identifying such motifs is a challenging problem. Behaviors have a multi-scale structure: the animal can be simultaneously performing a small-scale motif and a large-scale one (e.g. \textit{chewi…

2017-07-11abs ↗pdf ↗

The Random Parameters model was proposed to explain the structure of the covariance matrix in problems where most, but not all, of the eigenvalues of the covariance matrix can be explained by Random Matrix Theory. In this article, we explore other properties of the model, like the scaling of its PDF as one take larger …

2007-10-29abs ↗pdf ↗

We propose a method to visualize class similarity in large-scale classifiers.

problem Analyzing hierarchical structures and relationships in large-scale classification.
method Compute class similarity based on prediction scores and visualize the class similarity matrix.
result Visualizing class similarity matrices reveals hierarchical structures and relationships.

FaStR improves scalability for time-aware RS with varying coefficients.

problem Limited applicability of structured regression models to large-scale data with categorical effects and many interactions.
method Combines structured additive regression and factorization approaches in a neural network-based model implementation.
result FaStR scales better and performs competitively with other time-aware RS in prediction performance.

Residual Prior Diffusion integrates coarse latent priors with diffusion models for better generative tasks.

problem Diffusion models struggle with representing both large-scale and fine-scale details in data distributions.
method Two-stage framework: first a coarse prior model captures large-scale structure, then a diffusion model represents the residual.
result RPD accurately captures fine-scale details while preserving large-scale structure, outperforming standard diffusion models.

We develop a new statistical test for comparing variables with varying scales.

problem Comparing variables with different scales in multidimensional spaces.
method Order based on expectations of random variables, generalized stochastic dominance (GSD) order, regularized statistical test, linear optimization, imprecise probability models.
result Validated through multidimensional data from various fields.

Transformer models perform slower than convolutional networks in learning hierarchical language structures.

problem Understanding how neural networks learn hierarchical language structures.
method Theoretical scaling laws and empirical validation of neural network performance.
result Convolutional networks outperform transformers in learning hierarchical language structures.

Study how generalization scales with model size and data in quadratic neural networks.

problem Understanding how generalization scales with model size and data in quadratic neural networks.
method Analyzed 2\ell_2-regularized empirical test error minimization in a quadratic two-layer network with finite-sample setting and structured data.
result Revealed a phase diagram with distinct scaling regimes as the number of parameters varies, showing data-dependent power laws controlled by spectral structure of the target.

Study reveals neural scaling laws in random graphs and natural language models.

problem Understanding the origin of neural scaling laws in complex systems.
method Examined scaling laws in transformers trained on random walks and simplified natural language models.
result Neural scaling laws emerge in the absence of power law structure in data correlations.

A new method for efficient causal structure learning at scale.

problem Causal structure learning is computationally challenging at scale.
method Relaxed sparsest-permutation formulation with support-level relaxation and masked zero-fill incomplete Cholesky factorization.
result The method enables scalable comparison of candidate orderings and matches the accuracy of slower baselines.

SEMASIA provides a large dataset of latent representations for model comparison.

problem Difficulty in comparing semantic structures across different neural network models.
method Collection of latent representations from 1700 pretrained models across various benchmarks.
result Consistent semantic organization across models and datasets.

NO approximates non-Markovian BSDEs with polynomial scaling in 1/ε.

problem Complexity of NO approximations for structured families of BSDEs.
method Identifying structured families of non-Markovian BSDEs, informing NO's inductive bias.
result Polynomial scaling in 1/ε for NO approximations of BSDE solution operators.

The paper introduces structured variational families to improve scalability in black-box variational inference.

problem Scalability issues in black-box variational inference, especially for large datasets and hierarchical models.
method Developed structured variational families that achieve better iteration complexity of O(N) compared to full-rank families.
result Structured variational families can achieve better scaling with respect to dataset size N, improving iteration complexity from O(N^2) to O(N).

A new model for defective media using two scales.

problem Modeling defects in media with two scales.
method Generalization of Riemann-Cartan manifolds and fibre bundle theory, constructing a first-order placement map.
result Emergent behaviors like dislocations and disclinations arise from the interaction of macroscopic and microscopic scales.

Sparse representations using data dictionaries provide an efficient model particularly for signals that do not enjoy alternate analytic sparsifying transformations. However, solving inverse problems with sparsifying dictionaries can be computationally expensive, especially when the dictionary under consideration has a …

2015-11-16abs ↗pdf ↗

The statistical properties of the increments x(t+T) - x(t) of a financial time series depend on the time resolution T on which the increments are considered. A non-parametric approach is used to study the scale dependence of the empirical distribution of the price increments x(t+T) - x(t) of S&P Index futures, for time…

1997-05-08abs ↗pdf ↗

New method for scalable inference in large-scale regression models with complex error structures.

problem Challenges in statistical inference for large-scale regression models with dependent errors.
method Generalized Method of Wavelet Moments with Exogenous variables (GMWMX).
result Statistical validity and scalability of GMWMX for linear models with complex error structures.

We introduce deep scale-spaces (DSS), a generalization of convolutional neural networks, exploiting the scale symmetry structure of conventional image recognition tasks. Put plainly, the class of an image is invariant to the scale at which it is viewed. We construct scale equivariant cross-correlations based on a princ…

2019-05-28abs ↗pdf ↗

New algorithms estimate Jacobian matrices for large-scale machine learning.

problem Efficiently computing search directions for large nonlinear least squares.
method Exploit low-rank structure in Hessian to estimate Jacobian matrices.
result Two algorithms perform well compared to state-of-the-art methods.

Deep Retrieval learns a retrievable structure for efficient large-scale recommendations.

problem Efficiently retrieving top relevant candidates in large-scale recommendation systems.
method Deep Retrieval learns a retrievable structure directly from user-item interaction data, encoding candidates into a discrete latent space and optimizing a model to maximize accuracy.
result Deep Retrieval achieves almost the same accuracy as brute-force baseline and significantly outperforms ANN baselines in a live production system.

Study large-scale geometry of graph braid groups via cubical structures.

problem Classify and understand the quasi-isometry of graph braid groups.
method Exploit cubical structures to relate hyperbolicity, undistorted subgroups, and group decompositions.
result Complete classification of graph braid groups quasi-isometric to free groups.

We present Blitzkriging, a new approach to fast inference for Gaussian processes, applicable to regression, optimisation and classification. State-of-the-art (stochastic) inference for Gaussian processes on very large datasets scales cubically in the number of 'inducing inputs', variables introduced to factorise the mo…

2015-10-27abs ↗pdf ↗

In this paper we show similarities between turbulence and financial systems. Motivated by similarities between the two systems, we construct a multiscale model for hierarchical financial structures that exhibits a constant cascade of wealth from large financial entities to small financial entities. According to our mod…

2019-02-23abs ↗pdf ↗

Exploiting low-rank structure of the user-item rating matrix has been the crux of many recommendation engines. However, existing recommendation engines force raters with heterogeneous behavior profiles to map their intrinsic rating scales to a common rating scale (e.g. 1-5). This non-linear transformation of the rating…

2018-10-31abs ↗pdf ↗

The entropy density is an intuitive and powerful concept to study the complicated nonlinear processes derived from physical systems. We develop the minimum entropy density method (MEDM) to detect the structure scale of a given time series, which is defined as the scale in which the uncertainty is minimized, hence the p…

2006-07-30abs ↗pdf ↗