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

75150224299 · Jun 202019922001200920172026
48 results for random proportions

A new method for modeling insurance claim frequencies using random proportions.

problem Inaccurate fitting of classical distributions to insurance claim frequency data.
method Modeling claim frequencies using random proportions of insurance contracts and applying goodness-of-fit tests.
result A new statistical approach for better modeling insurance claim frequencies.

Paper compares different models for time-to-event analysis.

problem Comparing models for time-to-event analysis.
method Experimental comparison of semi-parametric, parametric, and machine learning models.
result Models' performance evaluated using concordance index.

Study compares Cox model and RSF for predicting patient survival, finding RSF superior in certain scenarios.

problem Comparing predictive accuracy of Cox proportional hazards model and Random Survival Forest for patient-specific survival probabilities.
method Conducted a comprehensive comparison study using simulation scenarios and real-world datasets.
result RSF outperforms Cox model in nonproportional hazards settings and with treatment-covariate interactions.

A new large-scale tabular benchmark for Learning from Label Proportions.

problem Lack of a large-scale open benchmark for tabular Learning from Label Proportions.
method Proposed LLP-Bench, a suite of 70 datasets (62 feature bag and 8 random bag) from real-world tabular data.
result Demonstrated the effectiveness of 9 SOTA and popular tabular LLP techniques on 62 feature bag datasets.

Proposes a proportional masking strategy for better tabular data imputation.

problem Heterogeneity of tabular data disrupts uniform random masking in MAEs.
method Computes missingness statistics, generates proportional masks, uses MLP token mixing.
result Proportional masking preserves missingness distribution, improves imputation performance.

Study examines how insurance affects households prone to proportional losses, especially those near poverty.

problem Impact of insurance on households susceptible to proportional losses, focusing on poverty traps.
method Modelled proportional capital losses with insurance, derived closed formulae and non-local differential equations.
result New formulae and methods to calculate trapping probability, constraints on parameters to prevent certainty of trapping.

New ridge regression bounds for high-dimensional data without proportional growth.

problem Moving beyond proportional asymptotics in high-dimensional statistics.
method Revisits ridge regression on i.i.d. data, allowing high-dimensional or infinite-dimensional feature vectors.
result Establishes non-asymptotic bounds approximating bias and variance of ridge regression.

This work efficiently learns linear threshold functions from label proportions using Gaussian distributions.

problem Efficiently learning linear threshold functions from label proportions.
method Using Gaussian distributions, the algorithm estimates means and covariance matrices, and identifies a low error hypothesis LTF.
result It is possible to efficiently learn LTFs using LTFs when given access to random bags of label proportions.

New pivoting strategy improves trace norm contraction in low-rank approximation.

problem Finding good low-rank approximations of symmetric, positive-definite matrices.
method Choosing rows with likelihood proportional to Aii2A_{ii}^2 for randomly pivoted partial Cholesky algorithm.
result Same trace norm contraction result in Frobenius norm for improved pivoting strategy.

Study of deep linear neural networks with proportional width and depth.

problem Lack of descriptive power in Gaussian limit of deep linear neural networks.
method Proportional infinite-width infinite-depth limit for deep linear neural networks.
result Characterization of limiting distribution as a nontrivial mixture of Gaussians.

We propose and study kernel conjugate gradient methods (KCGM) with random projections for least-squares regression over a separable Hilbert space. Considering two types of random projections generated by randomized sketches and Nyström subsampling, we prove optimal statistical results with respect to variants of norms …

2018-11-05abs ↗pdf ↗

The paper tackles resource allocation for arms with unknown and random rewards, achieving optimal regret bounds.

problem Allocating resources on arms with unknown and random rewards.
method Developed two algorithms with optimal regret bounds for b[0,1]b \in [0,1], demonstrating a phase transition at b=1/2b=1/2.
result Achieved optimal gap-dependent and gap-independent regret bounds for b[0,1]b \in [0,1].

We present an optimal investment theorem for a currency exchange model with random and possibly discontinuous proportional transaction costs. The investor's preferences are represented by a multivariate utility function, allowing for simultaneous consumption of any prescribed selection of the currencies at a given term…

2008-11-24abs ↗pdf ↗

ETM models improve efficiency in semi-supervised logistic regression.

problem Improving efficiency in logistic regression with limited labeled data.
method Developed exponential tilt mixture (ETM) models for semi-supervised estimation.
result ETM-based estimation demonstrates improved efficiency over supervised logistic regression.

The Cannon-Thurston map's pushed measures on the circle are singular with respect to sphere measures.

problem Understanding the behavior of geodesics and measures on fibered hyperbolic 3-manifolds.
method Properties of geodesics and measures on the circle and sphere are analyzed to prove singularity.
result Natural measures on the circle become singular with respect to measures on the sphere.

Study Gaussian approximation for deep neural networks with random weights.

problem Understanding the distribution of deep neural networks with random weights.
method Established Gaussian approximation bounds in Wasserstein-1 norm.
result Convergence rates of order n(1/6)L1+εn^{-({1}/{6})^{L-1} + ε} for deep networks with proportional layer widths.

Kernel ridge regression (KRR) is a standard method for performing non-parametric regression over reproducing kernel Hilbert spaces. Given nn samples, the time and space complexity of computing the KRR estimate scale as O(n3)\mathcal{O}(n^3) and O(n2)\mathcal{O}(n^2) respectively, and so is prohibitive in many cases. We prop…

2015-01-25abs ↗pdf ↗

New findings on kernel regression in the quadratic regime, improving understanding of machine learning models.

problem Understanding kernel ridge regression in the quadratic asymptotic regime.
method Extended study of kernel regression to the quadratic regime, establishing approximation bounds and spectral distributions.
result Broad class of inner-product kernels exhibit behavior similar to a quadratic kernel, with precise asymptotic training and test errors characterized.

In dynamic topic modeling, the proportional contribution of a topic to a document depends on the temporal dynamics of that topic's overall prevalence in the corpus. We extend the Dynamic Topic Model of Blei and Lafferty (2006) by explicitly modeling document level topic proportions with covariates and dynamic structure…

2015-11-12abs ↗pdf ↗

Random Reshuffling outperforms Stochastic Gradient Descent in smooth convex optimization.

problem Theoretical limitations of Random Reshuffling in smooth convex optimization.
method Random Reshuffling (RR) as a variant of Shuffling Stochastic Gradient Descent (Shuffling SGD).
result Random Reshuffling (RR) dominates Stochastic Gradient Descent (SGD) in smooth convex optimization under any reasonable stepsize after any finite number of epochs.

Random forest is widely exploited as an ensemble learning method. In many practical applications, however, there is still a significant challenge to learn from imbalanced data. To alleviate this limitation, we propose a deep dynamic boosted forest (DDBF), a novel ensemble algorithm that incorporates the notion of hard …

2018-04-19abs ↗pdf ↗

Random column sampling is not guaranteed to yield data sketches that preserve the underlying structures of the data and may not sample sufficiently from less-populated data clusters. Also, adaptive sampling can often provide accurate low rank approximations, yet may fall short of producing descriptive data sketches, es…

2017-05-09abs ↗pdf ↗

We show that real and imaginary parts of equivariant spherical harmonics on S3S^3 have almost surely a single nodal component. Moreover, if the degree of the spherical harmonic is NN and the equivariance degree is mm, then the expected genus is proportional to m(N2m22+N)m \left(\frac{N^2 - m^2}{2} + N\right) . Hence if $\fra…

2019-08-02abs ↗pdf ↗

We investigate financial market correlations using random matrix theory and principal component analysis. We use random matrix theory to demonstrate that correlation matrices of asset price changes contain structure that is incompatible with uncorrelated random price changes. We then identify the principal components o…

2010-11-14abs ↗pdf ↗

K-nearest neighbor (kNN) search has wide applications in many areas, including data mining, machine learning, statistics and many applied domains. Inspired by the success of ensemble methods and the flexibility of tree-based methodology, we propose random projection forests (rpForests), for kNN search. rpForests finds …

2018-12-31abs ↗pdf ↗

An investor with constant absolute risk aversion trades a risky asset with general Itô-dynamics, in the presence of small proportional transaction costs. In this setting, we formally derive a leading-order optimal trading policy and the associated welfare, expressed in terms of the local dynamics of the frictionless op…

2012-09-12abs ↗pdf ↗

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 ↗

fcHMRF-LIS controls FDR in neuroimaging data, improving power and scalability.

problem Complex spatial dependencies and high variability in FDR control methods for neuroimaging data.
method fcHMRF-LIS integrates LIS-based testing with fcHMRF to model spatial structures efficiently.
result fcHMRF-LIS achieves accurate FDR control, lower FNR, and higher true positives compared to existing methods.

We analyze the complexity of Gibbs samplers for inference in crossed random effect models used in modern analysis of variance. We demonstrate that for certain designs the plain vanilla Gibbs sampler is not scalable, in the sense that its complexity is worse than proportional to the number of parameters and data. We thu…

2018-03-26abs ↗pdf ↗

We introduce a semi-parametric Bayesian model for survival analysis. The model is centred on a parametric baseline hazard, and uses a Gaussian process to model variations away from it nonparametrically, as well as dependence on covariates. As opposed to many other methods in survival analysis, our framework does not im…

2016-11-02abs ↗pdf ↗

Efficiently estimates linear models robust to corrupted data.

problem Learning linear models under adversarial corruption and minimal distributional assumptions.
method Develops a polynomial relaxation of independence to achieve optimal convergence rate.
result Achieves optimal convergence rate of ε22/kε^{2-2/k} for kk-hypercontractive distributions.

The family of admissible positions in a transaction costs model is a random closed set, which is convex in case of proportional transaction costs. However, the convexity fails, e.g. in case of fixed transaction costs or when only a finite number of transfers are possible. The paper presents an approach to measure risks…

2019-02-02abs ↗pdf ↗

Paper improves deep learning for instance-level classification from label proportions.

problem Dealing with noisy pseudo-labeling and high-entropy class distributions in LLP.
method Introducing a two-stage training approach with constrained optimization and mixup strategy.
result Significant performance improvement in instance-level classification.

We explain theoretically a curious empirical phenomenon: "Approximating a matrix by deterministically selecting a subset of its columns with the corresponding largest leverage scores results in a good low-rank matrix surrogate". To obtain provable guarantees, previous work requires randomized sampling of the columns wi…

2014-04-06abs ↗pdf ↗