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

Trend · papers per month

70141211281 · Jun 202019922001200920172026
48 results for randomized truncation

The paper analyzes and mitigates biases in scalable Gaussian Process methods.

problem Modeling biases in scalable Gaussian Process methods.
method Randomized truncation estimators to eliminate bias in exchange for increased variance.
result Randomized truncation estimators meaningfully outperform biased counterparts with minimal additional computation.

Study on length spectrum of random hyperbolic 3-manifolds.

problem Understanding the length spectrum of random hyperbolic 3-manifolds.
method Modeling random hyperbolic 3-manifolds using truncated tetrahedra and analyzing their length spectrum as volume tends to infinity.
result The length spectrum converges in distribution to a Poisson point process with a computable intensity λ as volume increases.

Study on systole of random hyperbolic 3-manifolds, proving limit exists and calculating it.

problem Understanding the systole of random hyperbolic 3-manifolds.
method Modeling random hyperbolic 3-manifolds using truncated tetrahedra, calculating expected systole limit as volume increases.
result Closed formula and numerical approximation for the limit of the expected systole as volume tends to infinity.

In the paper "On Truncated Variation of Brownian Motion with Drift" (Bull. Pol. Acad. Sci. Math. 56 (2008), no.4, 267 - 281) we defined truncated variation of Brownian motion with drift, Wt=Bt+μt,t0,W_t = B_t + μt, t\geq 0, where (Bt)(B_t) is a standard Brownian motion. Truncated variation differs from regular variation by neglect…

2009-12-23abs ↗pdf ↗

Efficiently estimate Boolean product distribution parameters from truncated samples.

problem Estimating parameters of Boolean product distributions from truncated samples.
method Introducing fatness of truncation set, using membership queries, and adapting Stochastic Gradient Descent.
result Efficiently learn Boolean product distributions from truncated samples with small sample complexity.

Completely random measures (CRM) represent the key building block of a wide variety of popular stochastic models and play a pivotal role in modern Bayesian Nonparametrics. A popular representation of CRMs as a random series with decreasing jumps is due to Ferguson and Klass (1972). This can immediately be turned into a…

2016-06-08abs ↗pdf ↗

New algorithm improves inference for flexible models with infinite latent features.

problem Inference for models with infinite latent features is computationally challenging and limiting.
method Adaptive slice sampling for posterior inference with general completely random measures.
result Higher effective sample size and predictive performance compared to existing methods.

Computing partition functions, the normalizing constants of probability distributions, is often hard. Variants of importance sampling give unbiased estimates of a normalizer Z, however, unbiased estimates of the reciprocal 1/Z are harder to obtain. Unbiased estimates of 1/Z allow Markov chain Monte Carlo sampling of "d…

2016-10-15abs ↗pdf ↗

Paper extends LME models to allow sign constraints on coefficients with SDTN random effects.

problem Inference with sign constraints on random effects in LME models.
method Proposes SDTN distribution for random effects and develops likelihood-based approaches for estimation.
result Proposed constrained model improves real-world interpretations and achieves satisfactory performance.

Soft Truncation improves diffusion model performance by balancing loss scales across diffusion times.

problem Inverse correlation between density estimation and sample generation in diffusion models.
method Introduces Soft Truncation, a training technique that softens the truncation hyperparameter.
result Soft Truncation achieves state-of-the-art performance on various datasets.

Bayesian method estimates LTLL distribution parameters for time-to-event data.

problem Parameter estimation for time-to-event data with left truncation.
method Bayesian inference using Metropolis-Hastings algorithm.
result Bayesian estimation provides more stable and reliable parameter estimates.

Truncated Lévy flights are random walks in which the arbitrarily large steps of a Lévy flight are eliminated. Since this makes the variance finite, the central limit theorem applies, and as time increases the probability distribution of the increments becomes Gaussian. Here, truncated Lévy flights with correlated fluct…

1999-06-28abs ↗pdf ↗

RANDomized-exploration policy Optimization via Multiple Importance Sampling with Truncation (RANDOMIST) for PO with mediator feedback.

problem Policy Optimization in continuous control tasks.
method RANDomized-exploration policy Optimization via Multiple Importance Sampling with Truncation (RANDOMIST) for regret minimization in PO.
result Achieving constant regret under certain circumstances in PO with mediator feedback.

CACTI improves tabular data imputation by leveraging missingness patterns and contextual information.

problem Tabular data imputation with improved accuracy and robustness.
method Masked autoencoding approach with median truncated copy masking and contextual information.
result Average R2R^2 gain of 7.8% over the next best method across various datasets and missingness conditions.

New numerical method for non-linear asset price model with CEV volatility.

problem Describing stochastic volatility in asset price dynamics.
method Proposes a mean-reverting theta-rho model with CEV volatility, constructs a truncated EM method.
result Truncated EM solutions can evaluate path-dependent financial products.

This paper presents a new algorithm, termed \emph{truncated amplitude flow} (TAF), to recover an unknown vector x\bm{x} from a system of quadratic equations of the form yi=ai,x2y_i=|\langle\bm{a}_i,\bm{x}\rangle|^2, where ai\bm{a}_i's are given random measurement vectors. This problem is known to be \emph{NP-hard} in genera…

2016-05-26abs ↗pdf ↗

SUMO provides unbiased log marginal likelihood estimation for latent variable models.

problem Biased estimates of log marginal likelihood in latent variable models.
method Randomized truncation of infinite series for unbiased estimation.
result Models trained with SUMO give better test-set likelihoods than standard methods.

TG-GAN models dynamic graph evolution for continuous-time temporal graphs.

problem Challenges in modeling dynamic temporal graphs, especially in continuous time.
method Temporal Graph Generative Adversarial Network (TG-GAN) that models truncated edge sequences, time budgets, and node attributes.
result TG-GAN significantly outperforms existing methods in efficiency and effectiveness.

The problem of an arbitrary truncated Levy flight description using the method of cumulant approach has been solved. The set of cumulants of the truncated Levy distribution given the assumption of arbitrary truncation has been found. The influence of truncation shape on the truncated Levy flight properties in the Gauss…

2010-06-12abs ↗pdf ↗

Exact selective inference with randomization for Gaussian regression models.

problem Exact selective inference in Gaussian regression models.
method Introduces a pivot for exact selective inference with randomization, reducing the problem to a bivariate truncated Gaussian distribution.
result Our pivot leads to exact inference and produces narrower confidence intervals than related methods.

We present an approximated maximum likelihood method for the multifractal random walk processes of [E. Bacry et al., Phys. Rev. E 64, 026103 (2001)]. The likelihood is computed using a Laplace approximation and a truncation in the dependency structure for the latent volatility. The procedure is implemented as a package…

2011-12-01abs ↗pdf ↗

A new method prices time-to-event cash flows using survival analysis.

problem Pricing insurance investment portfolios with time-to-event cash flows.
method Discrete-time survival analysis framework, hazard rate estimators, asymptotic multivariate normality.
result Pricing model yields estimates closer to actual cash flows than non-random models.

Optimal algorithm learns Gaussian under halfspace truncation with minimal samples.

problem Learning a Gaussian distribution truncated to an unknown halfspace.
method Efficient algorithm using n=ildeO(d2/ε2)n = ilde{O}(d^2/\varepsilon^2) samples and runtime dominated by empirical covariance matrix computation.
result Optimal sample and time complexity bounds for learning a Gaussian under halfspace truncation.

Non-negative matrix factorization (NMF) minimizes the Euclidean distance between the data matrix and its low rank approximation, and it fails when applied to corrupted data because the loss function is sensitive to outliers. In this paper, we propose a Truncated CauchyNMF loss that handle outliers by truncating large e…

2019-06-02abs ↗pdf ↗

Filters in a Convolutional Neural Network (CNN) contain model parameters learned from enormous amounts of data. In this paper, we suggest to decompose convolutional filters in CNN as a truncated expansion with pre-fixed bases, namely the Decomposed Convolutional Filters network (DCFNet), where the expansion coefficient…

2018-02-12abs ↗pdf ↗

Study financial contagion and risk in sparse networks with directed edges.

problem Analyzing systemic risk in sparse financial networks with balance-sheet interactions.
method Linear fraction of institutions with zero out-degree, sender-truncated subgraph G_sh, adversarial and random systemic events, explicit fan-in accumulation bound.
result Maximal forward reachability in G_sh is O(log n) with high probability in the subcritical regime, and multi-hit defaults are negligible in the supercritical regime.

Motivated by a recent result of Daskalakis et al. 2018, we analyze the population version of Expectation-Maximization (EM) algorithm for the case of \textit{truncated} mixtures of two Gaussians. Truncated samples from a dd-dimensional mixture of two Gaussians $\frac{1}{2} \mathcal{N}(\vecμ, \vecΣ)+ \frac{1}{2} \mathca…

2019-02-19abs ↗pdf ↗

Paper proposes approximate Stein classes for efficient truncated density estimation.

problem Difficulties in estimating truncated density models due to intractable normalising constants and boundary conditions.
method Adapts score matching to solve the problem, introduces approximate Stein classes and a novel discrepancy measure, TKSD.
result TKSD does not require a fixed weighting function and can be evaluated using only boundary samples, leading to improved accuracy.

A new method distills datasets more efficiently and effectively.

problem Achieving competitive performance on test data with a small synthetic dataset.
method Tackles dataset distillation as a bilevel optimization problem, introduces RaT-BPTT to stabilize gradients and speed up optimization.
result Establishes new state-of-the-art performance across various benchmarks.

Optimality of TS with noninformative priors proven for Pareto model.

problem Optimality of Thompson Sampling with noninformative priors for Pareto bandits.
method Proved optimality of TS with certain probability matching priors, showed suboptimality with others, and found effectiveness of truncation procedures.
result TS with certain probability matching priors achieves optimal regret bound for Pareto model.

Paper proposes a novel method to assess treatment effect estimators using cross-validation.

problem Lack of ground truth to objectively assess treatment effect estimators in RCTs.
method Cross-validation-like methodology combining noisy difference-of-means estimate and aggregation across RCTs.
result Aggressive downweighting or truncation of large values reduces variance and improves treatment effect estimation.