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

174348522696 · Jun 202019922001200920172026
48 results for size distribution

Gradually Truncated Log-normal distribution - Size distribution of firms Abstract Many natural and economical phenomena are described through power law or log- normal distributions. In these cases, probability decreases very slowly with step size compared to normal distribution. Thus it is essential to cut-off these di…

2001-11-30abs ↗pdf ↗

In this paper we address the question of the size distribution of firms. To this aim, we use the Bloomberg database comprising multinational firms within the years 1995-2003, and analyze the data of the sales and the total assets of the separate financial statement of the Japanese and the US companies, and make a compa…

2005-12-14abs ↗pdf ↗

Proposes a differentiable hypergeometric distribution for learning group importance.

problem Learning the sizes of subsets in applications like clustering and weakly-supervised learning.
method Introduces a reparameterizable hypergeometric distribution to model group sizes and learn their relative importance.
result Outperforms previous methods in weakly-supervised learning and clustering.

Exact distribution of split conformal prediction coverage found.

problem Determining the reliability of prediction sets in batch mode.
method Analysis of exchangeable data to find universal distribution of empirical coverage.
result Exact distribution of empirical coverage is universal and determined by nominal miscoverage level and calibration sample size.

Revisits granular models explaining firm growth rates and sizes.

problem Understanding the relationship between firm size and growth rate statistics.
method Developed new theoretical insights linking firm size and growth rate statistics within granular models.
result Growth volatility distribution is size-independent but fat-tailed, challenging granular models.

Adaptive batch sizes improve local gradient methods in distributed training.

problem Communication bottlenecks in distributed deep learning.
method Adaptive batch size strategies for local gradient methods.
result Adaptive batch sizes reduce minibatch gradient variance and improve training efficiency.

Theory explains power-law distributions without complex models.

problem Understanding power-law distributions in geometrically growing systems.
method Developed a theory of geometrically growing systems and applied it to explain various distributions.
result The geometrically growing system's distribution flattens over time, increasing relative size ratios.

Reflective of income and wealth distributions, philanthropic gifting appears to follow an approximate power-law size distribution as measured by the size of gifts received by individual institutions. We explore the ecology of gifting by analysing data sets of individual gifts for a diverse group of institutions dedicat…

2013-07-08abs ↗pdf ↗

This paper highlights the size-dependency of income distributions, i.e. the income distribution curves versus the population of a country systematically. By using the generalized Lotka-Volterra model to fit the empirical income data in the United States during 1996-2007, we found an important parameter λλ can scale wi…

2010-12-09abs ↗pdf ↗

A bipartite producer-consumer network is constructed to describe the industrial structure. The edges from consumer to producer represent the choices of the consumer for the final products and the degree of producer can represent its market share. So the size distribution of firms can be characterized by producer's degr…

2005-07-21abs ↗pdf ↗

We introduce a simple agent-based model which allows us to analyze three stylized facts: a fat-tailed size distribution of companies, a `tent-shaped' growth rate distribution, the scaling relation of the growth rate variance with firm size, and the causality between them. This is achieved under the simple hypothesis th…

2013-04-16abs ↗pdf ↗

Study finds optimal vocabulary size for neural machine translation.

problem Imbalanced class distribution in language data affects NMT performance.
method Casts NMT as a classification task, analyzes vocabulary sizes, and tests multiple languages.
result Certain vocabulary sizes outperform others, explaining NMT performance.

Firm size data usually do not show the normality that is often assumed in statistical analysis such as regression analysis. In this study we focus on two firm size data: the number of employees and sale. Those data deviate considerably from a normal distribution. To improve the normality of those data we transform them…

2015-11-23abs ↗pdf ↗

The tail of the distribution of a sum of a random number of independent and identically distributed nonnegative random variables depends on the tails of the number of terms and of the terms themselves. This situation is of interest in the collective risk model, where the total claim size in a portfolio is the sum of a …

2007-03-01abs ↗pdf ↗

A microscopic model of aggregation and fragmentation is introduced to investigate the size distribution of businesses. In the model, businesses are constrained to comply with the market price, as expected by the customers, while customers can only buy at the prices offered by the businesses. We show numerically and ana…

2000-08-14abs ↗pdf ↗

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…

2000-06-16abs ↗pdf ↗

We consider dd-dimensional linear stochastic approximation algorithms (LSAs) with a constant step-size and the so called Polyak-Ruppert (PR) averaging of iterates. LSAs are widely applied in machine learning and reinforcement learning (RL), where the aim is to compute an appropriate θRdθ_{*} \in \mathbb{R}^d (that is a…

2017-09-12abs ↗pdf ↗

This paper characterizes projective models in statistical relational learning.

problem Projectivity in statistical relational models is beneficial for inference and learning.
method Representation theorems for infinite exchangeable arrays to characterize projective models.
result A class of directed graphical latent variable models correspond to projective relational models.

Estimates unknown population sizes using the hypergeometric distribution.

problem Estimating discrete distributions with unknown population sizes and category sizes.
method Proposes a novel solution using the hypergeometric likelihood, accounting for a data generating process with a latent variable.
result Empirically demonstrates superior performance in estimating population sizes and learning latent spaces compared to other methods.

Using public data (Forbes Global 2000) we show that the asset sizes for the largest global firms follow a Pareto distribution in an intermediate range, that is ``interrupted'' by a sharp cut-off in its upper tail, where it is totally dominated by financial firms. This flattening of the distribution contrasts with a lar…

2013-09-09abs ↗pdf ↗

Study optimizes step size for Metropolis algorithm in non-identifiable cases.

problem Optimizing step size for Metropolis algorithm in non-identifiable models.
method Analytical derivation of average acceptance rate for non-identifiable cases.
result Developed optimization principle for step size based on average acceptance rate.

Adaptive batch size schedules improve language model training efficiency and generalization.

problem Dilemma of choosing batch sizes in large-scale model training.
method General-purpose adaptive batch size schedules compatible with data and model parallelism.
result Adaptive batch size schedules outperform constant batch sizes and heuristic warmup schedules.

New method improves model accuracy in Byzantine-robust distributed learning by optimizing batch size.

problem Reduces model accuracy drop due to large variance of stochastic gradients in Byzantine-robust distributed learning.
method Proposes ByzSGDnm, a novel BRDL method that uses normalized momentum to mitigate accuracy drop in large batch sizes.
result The optimal batch size increases with the fraction of Byzantine workers, leading to better model accuracy under Byzantine attacks.

Delayed rejection HMC improves sampling efficiency for multiscale distributions.

problem Hamiltonian Monte Carlo struggles with wide-ranging distributions, especially in high-curvature areas.
method Introduces a delayed rejection variant of HMC, using geometrically smaller step sizes for retries.
result Up to five-fold performance gains in effective sample size per gradient evaluation.

Novel method uses Gaussian process to estimate particle sizes from scattering data.

problem Estimating particle size distributions from noisy optical scattering measurements.
method Constrained Gaussian process regression with normalization constraints.
result Accurately reconstructs particle size distributions from noisy data.

We present the Integrated Size and Price Optimization Problem (ISPO) for a fashion discounter with many branches. Based on a two-stage stochastic programming model with recourse, we develop an exact algorithm and a production-compliant heuristic that produces small optimality gaps. In a field study we show that a distr…

2014-01-31abs ↗pdf ↗

BDC compresses both sample size and dimensionality of large datasets.

problem Large datasets in both sample size and dimensionality.
method Two-stage framework using Decoded MMD, Reconstruction MMD, and Encoded MMD.
result BDC achieves comparable or superior performance with lower cost and higher compression rates.

Determining the appropriate batch size for mini-batch gradient descent is always time consuming as it often relies on grid search. This paper considers a resizable mini-batch gradient descent (RMGD) algorithm based on a multi-armed bandit for achieving best performance in grid search by selecting an appropriate batch s…

2017-11-17abs ↗pdf ↗

This study links blockchain design to cryptos' distributional characteristics.

problem Understanding the relationship between blockchain design and cryptos' distributional characteristics.
method Used spectral clustering to cluster cryptos based on their blockchain mechanisms and operational features.
result Clusters of cryptos share similar blockchain mechanisms, supporting the hypothesis.

New convergence results for NGVI with various step sizes and sample sizes.

problem Understanding convergence of stochastic NGVI for various schedules.
method Projected stochastic NGVI for exponential family variational distributions.
result Geometric convergence and $\mathcal{O}\left(\frac{1}{T^ρ} ight)$ rates for different schedules.

A theory of exceptional extreme events, characterized by their abnormal sizes compared with the rest of the distribution, is presented. Such outliers, called "dragon-kings", have been reported in the distribution of financial drawdowns, city-size distributions (e.g., Paris in France and London in the UK), in material f…

2012-05-07abs ↗pdf ↗

A novel distributed adaptive NN classifier for large data sets.

problem Handling large and distributed data for efficient classification.
method Distributed adaptive nearest neighbor classifier with stochastic tuning parameter selection and early stopping rule.
result Achieves nearly optimal convergence rate under large sub-sample sizes.

We address the question of the growth of firm size. To this end, we analyze the Compustat data base comprising all publicly-traded United States manufacturing firms within the years 1974-1993. We find that the distribution of firm sizes remains stable for the 20 years we study, i.e., the mean value and standard deviati…

1997-02-10abs ↗pdf ↗

Quantized Stochastic Primal-Dual Methods for Distributed Optimization

problem Distributed optimization with stochastic gradients and finite-bit communication
method q-PDGD, a quantized stochastic primal-dual method
result Linear contraction to an explicit neighborhood under RSI, O(1/k) convergence under PL inequality