We accelerate CNF by reducing ODE truncation errors with polynomial regularization.
problem High computation cost of CNF due to large truncation errors in solving ODEs.
method Add polynomial regularization to approximate ODE trajectories with polynomial functions.
result 42.3% to 71.3% reduction of NFE on density estimation, 19.3% to 32.1% on variational auto-encoder.
Lower bound shows super-polynomial gap for estimating truncated Gaussian means.
problem Estimating mean of truncated Gaussian distribution with limited samples.
method Statistical Query (SQ) lower bounds for learning.
result Super-polynomial information-computation gap for the task.
We solve for functions from their truncated Hilbert transforms using Chebyshev series.
problem Finding functions from their truncated Hilbert transforms.
method Express functions in Chebyshev series and numerically estimate coefficients.
result Numerical methods work well for extrapolating functions from truncated Hilbert transforms.
We consider an appoximation of a catenoid constructed from "odd" truncated cones that maintains minimality in a certain sense. Thorough this procedure, we obtain a discrete curve approximating a catenary by exploiting the fact that it is the function that generates a catenoid. In this investigation, the theory of the G…
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) samples and runtime dominated by empirical covariance matrix computation. result Optimal sample and time complexity bounds for learning a Gaussian under halfspace truncation.
Proves volume conjecture for double twist knots using complexified tetrahedrons.
problem Volume conjecture for double twist knots
method Complexified tetrahedron and associated SL(2, C) representation of fundamental group
result Volume conjecture proved for double twist knots
New Poisson structures on hypersurface algebroids discovered.
problem Symplectic forms on hypersurface algebroids.
method Detailed study of Lie algebroid de Rham complex, deformation of symplectic forms.
result Construction of universal hypersurface algebroids with canonical Poisson structures.
A method for interpreting SVMs using polynomial kernels, revealing model complexity.
problem Interpreting SVMs built with truncated orthogonal polynomial kernels.
method Orthogonal Representation Contribution Analysis (ORCA) with normalized Orthogonal Kernel Contribution (OKC) indices.
result The method reveals structural aspects of model complexity not captured by predictive accuracy.
New method improves DAG learning by using large coefficients for higher-order terms.
problem Recovering DAG structures from observational data is challenging due to combinatorial optimization.
method Proposes truncated matrix power iteration to approximate DAG constraints efficiently.
result Empirically outperforms previous methods by a factor of 3 or more in structural Hamming distance.
New algorithms estimate parameters of Gaussian and non-Gaussian distributions from truncated samples.
problem Estimating distributional parameters from truncated samples.
method Polynomial time algorithms for exponential families and simple sets.
result Efficient algorithms for estimating parameters of various distributions from truncated samples.
Paper introduces a new symbol map for differential symmetry breaking operators.
problem Generalizing the symbol map to non-abelian settings.
method Introduces and studies the truncated symbol map Symb0(D). result Classified and constructed differential intertwining operators and homomorphisms.
We give a formula of the colored Alexander invariant in terms of the homological representation of the braid groups which we call truncated Lawrence's representation. This formula generalizes the famous Burau representation formula of the Alexander polynomial.
We introduce polynomial processes taking values in an arbitrary Banach space B via their infinitesimal generator L and the associated martingale problem. We obtain two representations of the (conditional) moments in terms of solutions of a system of ODEs on the truncated tensor algebra of dual respectively bidual s…
We study the problem of estimating the parameters of a Gaussian distribution when samples are only shown if they fall in some (unknown) subset S⊆Rd. This core problem in truncated statistics has long history going back to Galton, Lee, Pearson and Fisher. Recent work by Daskalakis et al. (FOCS'18), provide…
We provide an efficient algorithm for the classical problem, going back to Galton, Pearson, and Fisher, of estimating, with arbitrary accuracy the parameters of a multivariate normal distribution from truncated samples. Truncated samples from a d-variate normal N(μ,Σ) means a samples is only re…
TKRR improves KRR performance by aligning target functions with kernels.
problem Improving kernel ridge regression performance through target alignment.
method Focuses on truncated kernel ridge regression (TKRR) with an additional spectral truncation parameter.
result TKRR can achieve faster rates than full KRR, reaching parametric rates.
The Hirzebruch signature formula provides an obstruction to the following realization question: given a rational Poincaré duality algebra A, does there exist a smooth manifold M such that H∗(M;Q)=A? This problem is especially interesting for rational truncated polynomial algebras who…
Smoothed analysis shows that many classes become learnable from positive-only samples.
problem Learning from positive-only samples is challenging due to negative results in worst-case settings.
method Smoothed analysis of positive-only learning, assuming samples from a reference distribution smooth with respect to the true distribution.
result All VC classes become learnable in the smoothed model with O(VC/ε2) positive samples for ε classification error. New sampling method for Heston model reduces complexity.
problem Efficient sampling for Heston model's time integrated variance.
method Series expansion, change of measure, Chebyshev polynomial approximations.
result Strong, efficient sampling scheme established for Heston model.
Maps and embeddings between hyperbolic spaces and their boundaries studied.
problem Understanding relations between maps and embeddings between relatively hyperbolic spaces and their boundaries.
method Establishing correspondences between quasi-isometric embeddings and quasisymmetric embeddings, using polynomial distortion.
result Characterization of hyperbolic relative groups with polynomial distortion embeddings.
Efficiently estimates covariance for sub-Weibull vectors with sub-Gaussian rate.
problem Outliers in high-dimensional covariance estimation.
method Cross-Fitted Norm-Truncated Estimator for Sub-Weibull distributions.
result Achieves optimal sub-Gaussian rate with O(Nd2) operations. 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…
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.
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,t≥0, where (Bt) is a standard Brownian motion. Truncated variation differs from regular variation by neglect…
New method for constructing truncated vine copulas.
problem High-dimensional parameter space in vine copulas.
method Propose a new score and algorithm for constructing truncated vines.
result New algorithms exploit conditional independences.
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…
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.
Paper defines new risk measures for elliptical distributions.
problem Risk measurement for elliptical distributions.
method DTM, DTS, DTK definitions and formula derivation for specific distributions.
result Explicit formulas for DTE, DTV, DTS, and DTK for various distributions.
Polynomial-time algorithm learns high-dimensional halfspaces without labels.
problem Learning high-dimensional halfspaces with margins in polynomial time.
method Contrastive moments and polynomial-time algorithm.
result Establishes the unique and efficient identifiability of the hidden halfspace.
The paper models asset prices using Wiener chaos expansions for efficient calibration to implied volatility surfaces.
problem Calibrating to implied volatility surfaces using flexible martingale models.
method Constructing an over-parameterized martingale model based on Wiener chaos expansions and conditional expectations.
result The method enables fast calibration to implied volatility surfaces and demonstrates flexibility through numerical experiments.
We define a simplicial differential calculus by generalizing divided differences from the case of curves to the case of general maps, defined on general topological vector spaces, or even on modules over a topological ring K. This calculus has the advantage that the number of evaluation points growths linearly with the…
New DP framework using data truncation for efficient estimation.
problem Differential privacy in unbounded data support.
method Data truncation, exponential family distributions, maximum likelihood estimation, DP stochastic gradient descent.
result Near-optimal sample complexity for Gaussian mean and covariance estimation.
Unified framework for mean testing under truncation bias.
problem High-dimensional mean testing under arbitrary truncation.
method Characterizes fundamental limits and develops a simple second-order test.
result Unified framework connects finite-moment, sub-Gaussian, and median-regular structural regimes.
Score matching method improves density estimation for truncated data on manifolds.
problem Density estimation for truncated data on manifolds with intractable normalising constant.
method Truncated score matching extended to Riemannian manifolds with boundary.
result Score matching estimator approximates true parameter values with low error.
Truncated backpropagation through time (TBPTT) is a popular method for learning in recurrent neural networks (RNNs) that saves computation and memory at the cost of bias by truncating backpropagation after a fixed number of lags. In practice, choosing the optimal truncation length is difficult: TBPTT will not converge …
Truncated densities are probability density functions defined on truncated domains. They share the same parametric form with their non-truncated counterparts up to a normalizing constant. Since the computation of their normalizing constants is usually infeasible, Maximum Likelihood Estimation cannot be easily applied t…
The method approximates stationary distributions of Markov models by truncating irrelevant states.
problem Computing the stationary distribution of complex Markov models is computationally challenging.
method A state-space lumping scheme that aggregates states in a grid structure, iteratively refining the state-space.
result The method provides a well-justified finite-state projection tailored to the stationary behavior of Markov models.
The model uses signatures to accurately calibrate SPX and VIX options without jumps or rough volatility.
problem Joint calibration of SPX and VIX options without jumps or rough volatility.
method The approach uses a stochastic volatility model with signatures of polynomial diffusions to price and calibrate SPX and VIX options.
result Highly accurate calibration results for SPX and VIX options without adding jumps or rough volatility.
Paper tackles overestimation bias in continuous control, improving performance by 25%.
problem Overestimation bias in off-policy learning.
method Truncated Quantile Critics (TQC) combines distributional representation, truncation, and ensembling of critics.
result TQC outperforms state-of-the-art methods by 25% on the Humanoid environment.
Estimates domain truncation error for option pricing PDEs.
problem Estimating error in option pricing models with domain truncation.
method Derives an estimate of domain truncation error for a multidimensional PDE system.
result Proposes a sharper error estimate for option pricing models.
Choppy optimizes ranked list truncation using Transformer architecture.
problem Optimal truncation of ranked search results to balance relevance and user cost.
method Assumption-free Transformer model optimizing user-defined IR metrics.
result Choppy improves upon recent state-of-the-art methods.
Markov Chain Monte Carlo (MCMC) and Belief Propagation (BP) are the most popular algorithms for computational inference in Graphical Models (GM). In principle, MCMC is an exact probabilistic method which, however, often suffers from exponentially slow mixing. In contrast, BP is a deterministic method, which is typicall…
New COS method formula improves option pricing accuracy.
problem Determining the optimal truncation range for COS method.
method Derive new formula using Markov's inequality to ensure convergence.
result New formula leads to more accurate option pricing.
The generalized correlation approach, which has been successfully used in statistical radio physics to describe non-Gaussian random processes, is proposed to describe stochastic financial processes. The generalized correlation approach has been used to describe a non-Gaussian random walk with independent, identically d…
Optimized Franz-Parisi criterion matches SQ lower bounds for various statistical models.
problem Understanding computational hardness in statistical inference.
method Proposed and refined Franz-Parisi criterion, established equivalence with SQ lower bounds.
result Optimized Franz-Parisi criterion is equivalent to Statistical Query (SQ) lower bounds.
We propose a new least-squares Monte Carlo algorithm for the approximation of conditional expectations in the presence of stochastic derivative weights. The algorithm can serve as a building block for solving dynamic programming equations, which arise, e.g., in non-linear option pricing problems or in probabilistic dis…
Let (X,g) be a compact Riemannian stratified space with simple edge singularity. Thus a neighbourhood of the singular stratum is a bundle of truncated cones over a lower dimensional compact smooth manifold. We calculate the various polynomially weighted de Rham cohomology spaces of X, as well as the associated spac…
As in standard linear regression, in truncated linear regression, we are given access to observations (Ai,yi)i whose dependent variable equals yi=AiT⋅x∗+ηi, where x∗ is some fixed unknown vector of interest and ηi is independent noise; except we are only given an observation if its dep…