Efficient algorithm reduces communication costs in distributed sparse learning.
problem High-dimensional distributed sparse learning with reduced communication costs.
method Two-way Truncation procedure to reduce communication cost, solving l 1 l_1 l 1 regularized minimization problem. result The estimation error decreases exponentially and matches centralized method under mild assumptions.
Ensemble of GANs improves performance on disconnected data.
problem Disconnected datasets in computer vision cannot be represented by continuous GANs.
method Construct an optimization problem to relate single GAN, ensemble of GANs, conditional GANs, and Gaussian Mixture GANs.
result Ensemble of GANs outperforms single GANs with fewer parameters.
Proposes a method to estimate policy values in reinforcement learning with unmeasured confounders.
problem Estimating policy values in reinforcement learning with unmeasured confounders.
method Develops a two-way deconfounder algorithm using a neural tensor network to learn unmeasured confounders and system dynamics.
result Consistent policy value estimation through model-based estimator.
A new estimator reduces bias and improves efficiency for staggered adoption studies.
problem Bias in difference-in-differences estimates for staggered adoption studies.
method Fused Extended Two-Way Fixed Effects (FETWFE) estimator with automatic parameter selection.
result FETWFE identifies correct restrictions with probability tending to one, improving efficiency.
Deep learning optimizes constellation for two-way relaying networks, boosting sum rate.
problem Optimizing constellation for better performance in two-way relaying networks.
method Deep neural networks (DNNs) trained to minimize cross entropy loss for direct constellation optimization.
result Significant performance gain in achievable sum rate compared to conventional relaying schemes.
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…
Truncated CauchyNMF robustly learns subspaces from noisy data.
problem Outliers in non-negative matrix factorization (NMF) cause failure.
method Proposes Truncated CauchyNMF loss to handle outliers.
result Theoretical analysis and experimental validation show Truncated CauchyNMF's robustness.
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, W t = B t + μ t , t ≥ 0 , W_t = B_t + μt, t\geq 0, W t = B t + μ t , t ≥ 0 , where ( B t ) (B_t) ( B t ) is a standard Brownian motion. Truncated variation differs from regular variation by neglect…
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 = i l d e O ( d 2 / ε 2 ) n = ilde{O}(d^2/\varepsilon^2) n = i l d e O ( d 2 / ε 2 ) samples and runtime dominated by empirical covariance matrix computation. result Optimal sample and time complexity bounds for learning a Gaussian under halfspace truncation.
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.
WHInter solves high-dimensional sparse interaction models efficiently.
problem Learning sparse models with two-way interactions in high-dimensional data.
method Working set algorithm for l1-regularised problems with quadratic interactions.
result Two orders of magnitude faster than state-of-the-art methods.
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.
Paper proposes a method to estimate truncated density models using Score Matching.
problem Estimating parameters of truncated probability densities.
method Score Matching with a novel weight function derived from Stein discrepancy.
result The proposed method minimizes a weighted Fisher divergence and corrects outlier-trimming bias.
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.
The paper provides estimates for flows on Riemannian manifolds using truncated expansions.
problem Quantifying the relationship between flows on Riemannian manifolds and their truncated logarithms.
method Using truncated versions of the Magnus and Baker-Cambel-Hausdorff-Dynkin expansions.
result Quantitative estimates between flows and their truncated logarithms.
Algorithm estimates Gaussian parameters under unknown truncation sets.
problem Estimating Gaussian parameters when samples are truncated to unknown sets.
method Efficient algorithm for arbitrary unknown truncation sets, using Gaussian surface area as complexity measure.
result Algorithm works for large families of sets including intersections of halfspaces and general convex sets.
Paper studies non-convex truncated loss functions for robust learning.
problem Improving generalization with non-convex loss functions.
method Truncating traditional loss functions and using SGD.
result Excess risk bounds and stationary points found by SGD.
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.
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.
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…
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.
Paper proposes using truncated normal distribution for RRC model, improving detection of minority classes.
problem Improving weak classifiers in RRC models.
method Proposes using truncated normal distribution and soft confusion matrix for RRC model.
result Truncated-normal-based SCM algorithm outperforms beta distribution in discovering minority classes.
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.
Adaptive TBPTT controls gradient bias in RNNs for faster convergence.
problem Choosing optimal truncation length in TBPTT for RNNs is difficult.
method Adaptive TBPTT converts lag selection to bias control, estimating optimal truncation length during training.
result Adaptive TBPTT improves convergence rate and computational efficiency in RNNs.
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 extend the Caffarelli-Cordoba estimates to the vector case in two ways, one of which has no scalar counterpart, and we give a few applications for minimal solutions.
Spectrally-truncated KRR outperforms full KRR for large data.
problem Computational intensity of KRR for large datasets.
method Spectrally truncating the kernel matrix to its largest r r r eigenvalues. result Spectrally-truncated KRR can outperform full KRR for all finite samples above a threshold.
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…
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.
As in standard linear regression, in truncated linear regression, we are given access to observations ( A i , y i ) i (A_i, y_i)_i ( A i , y i ) i whose dependent variable equals y i = A i T ⋅ x ∗ + η i y_i= A_i^{\rm T} \cdot x^* + η_i y i = A i T ⋅ x ∗ + η i , where x ∗ x^* x ∗ is some fixed unknown vector of interest and η i η_i η i is independent noise; except we are only given an observation if its dep…
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.
A new adaptive truncation method improves causal inference performance.
problem Practical violations of positivity assumption in causal inference.
method Positivity-C-TMLE based on C-TMLE methodology.
result Adaptive truncation improves performance in point estimation and confidence intervals.
We show that generalised geometry gives a unified description of maximally supersymmetric consistent truncations of ten- and eleven-dimensional supergravity. In all cases the reduction manifold admits a "generalised parallelisation" with a frame algebra with constant coefficients. The consistent truncation then arises …
Adaptive Nucleus Truncation Improves Long-Form Reasoning
problem Improving long-form reasoning in language models
method Adaptive Nucleus Truncation Sampling (ANTS)
result Significant performance gains across various benchmarks
Proposes a method to handle sparse multiway count data with false zeros using zero-truncated Poisson regression.
problem Handling sparse multiway count data corrupted by false zeros.
method Zero-truncated Poisson regression with tensor completion.
result Accurate estimation of multiway count data from approximately I R 2 log 2 2 ( I ) IR^2\log_2^2(I) I R 2 log 2 2 ( I ) non-zero counts. Estimates inverse temperature of Ising models with a single sample.
problem Estimating inverse temperature in truncated Ising models with hard constraints.
method Maximizing pseudolikelihood to estimate the inverse temperature.
result An estimator that is nearly O ( n ) O(n) O ( n ) time and O ( Δ 3 / n ) O(Δ^3/\sqrt{n}) O ( Δ 3 / n ) -consistent. The paper studies deformation spaces of Coxeter truncation polytopes.
problem Understanding the geometric properties and deformations of Coxeter truncation polytopes.
method Analyzing Coxeter truncation polytopes and their deformation spaces.
result Description of deformation spaces for Coxeter truncation polytopes of dimension d ⩾ 4 d \geqslant 4 d ⩾ 4 . The paper connects quantum 6 j 6j 6 j -symbols to tetrahedra volumes via discrete Fourier transforms.
problem Understanding the asymptotic behavior of quantum 6 j 6j 6 j -symbols and their relation to 3-manifold invariants. method Proposing and proving a conjecture linking discrete Fourier transforms of quantum 6 j 6j 6 j -symbols to the volumes of deeply truncated tetrahedra. result Supporting evidence for the conjecture in specific cases, with numerical calculations for larger dihedral angles.
Typically, operational risk losses are reported above some threshold. This paper studies the impact of ignoring data truncation on the 0.999 quantile of the annual loss distribution for operational risk for a broad range of distribution parameters and truncation levels. Loss frequency and severity are modelled by the P…
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.
Paper develops efficient method for probability estimation.
problem Estimating probabilities with high efficiency.
method Adaptive Monte Carlo estimation using truncated inverse binomial sampling.
result Proposed method is orders of magnitude more efficient.
Algorithm estimates multivariate normal parameters from hidden truncated samples.
problem Estimating parameters of multivariate normal distribution from hidden truncated samples.
method Efficient algorithm using polynomial-time estimation with oracle access to the subset S.
result Estimation of mean and covariance matrix with arbitrary accuracy.
The paper investigates the convergence of Vendi scores under finite samples and introduces a truncated version for better performance.
problem The Vendi score's convergence is hindered by computational limitations when using large sample sizes.
method The authors introduce the t-truncated Vendi score to address this issue by truncating the eigenspectrum of the kernel matrix.
result The t-truncated Vendi score converges to its asymptotic limit with a smaller number of samples, improving upon the standard Vendi score.