A fast method estimates stability of ensemble feature selectors.
problem Improving stability of ensemble feature selectors for better prediction.
method Simulator of a feature selector to estimate stability.
result Reduces computation time for estimating stability.
A new estimator for asynchronous tick data shows better correlation estimates.
problem Estimating correlation from asynchronous tick data.
method Derive a minimum-variance estimator and a fast linear-time estimator.
result The fast tickwise estimator has smaller estimation errors than the usual method.
The paper derives gradient estimates for porous medium and fast diffusion equations on metric measure spaces.
problem Gradient estimates for porous medium and fast diffusion equations on metric measure spaces.
method Derives Li-Yau and Souplet-Zhang type gradient estimates for the given equations.
result Gradient estimates for the equations on complete noncompact metric measure spaces with compact boundary.
Purpose: To investigate the feasibility of myelin water content quantification using fast dual-echo steady-state (DESS) scans and machine learning with kernels. Methods: We optimized combinations of steady-state (SS) scans for precisely estimating the fast-relaxing signal fraction ff of a two-compartment signal model, …
Deep neural nets estimate operators between infinite-dimensional spaces with fast rates.
problem Estimating operators between infinite-dimensional spaces.
method Deep neural networks for nonparametric estimation of Lipschitz operators.
result Error bounds decay with fast rates depending on intrinsic dimension.
The paper develops fast Bayesian methods for estimating huge PVARs with competitive forecasts.
problem Computational and statistical issues in estimating PVARs with many parameters.
method Integrated rotated Gaussian approximations, exploiting domestic over international information, and fast approximations for international coefficients.
result Produces competitive forecasts quickly using a huge world economy model.
Paper presents a fast method for estimating hidden states in Bayesian models.
problem Estimating hidden states in Bayesian state space models efficiently.
method Amortized simulation-based inference with pretraining.
result The method achieves sufficient accuracy and fast inference times.
A fast method for estimating radar amplitude density parameters.
problem Accurate estimation of amplitude density function parameters in radar applications.
method Projecting amplitude data onto horizontal and vertical axes, then using MLE for α-stale distribution parameters. result The average of computed MLEs based on two projections is a fast and accurate estimator for amplitude distribution parameters.
This paper provides fast estimates for complex option types.
problem Estimating prices for constrained multiple exercise American options.
method Lookahead search for lower estimates and nearest-neighbor martingale for upper estimates.
result Probabilistic convergence guarantees for the algorithms.
New method for fast volatility estimation robust to change points.
problem Robust high-frequency volatility estimation with change points.
method ℓ1-regularized power variation estimators using LARS for sparse estimation and dynamic programming for change point refinement.
result Minimax rates achieved for volatility estimators, providing accurate and smooth forecasts.
Develops a privacy-preserving algorithm for sparse robust regression.
problem Privacy-preserving machine learning for sparse robust regression.
method Develops FRAPPE algorithm for non-smooth loss under differential privacy.
result Achieves better privacy and statistical accuracy trade-off.
We consider gradient estimates to positive solutions of porous medium equations and fast diffusion equations: ut=Δφ(up) associated with the Witten Laplacian on Riemannian manifolds. Under the assumption that the m-dimensional Bakry-Emery Ricci curvature is bounded from below, we obtain gradient estimates which…
Enhances Fourier estimator performance for asynchronous event-data.
problem Improving correlation and covariance estimation on event-data.
method Implement and test NUFFT methods with different averaging kernels.
result Demonstrates improved performance and relationship between averaging scales.
A fast method estimates Gaussian mixture components without iterative fitting.
problem Estimating the number of components in high-dimensional Gaussian mixtures.
method Center data, compute singular values, and count above a threshold.
result The estimator consistently recovers the true number of components under mild separation condition.
Efficiently simulates slow dynamics of high-dimensional stochastic systems.
problem Simulating high-dimensional stochastic systems with slow dynamics and fast modes.
method Designs an algorithm to estimate an invariant manifold and its dynamics, averaging out fast modes.
result Efficient simulator of effective dynamics on low-dimensional invariant manifold.
A fast model estimates future prices from orderbook data.
problem Estimating future prices from orderbook data.
method Hyperdimensional vector Tsetlin machine framework for fast estimation.
result Demonstrated robust estimate of future prices.
Kernel density estimation (KDE) is a popular statistical technique for estimating the underlying density distribution with minimal assumptions. Although they can be shown to achieve asymptotic estimation optimality for any input distribution, cross-validating for an optimal parameter requires significant computation do…
The paper studies efficient simulation methods for financial firm values under fast mean-reverting volatility.
problem Estimating the probability of firm default under fast mean-reverting stochastic volatility models.
method Approximations using ergodic averages and central limit theorem corrections for efficient simulation.
result Accuracy of approximations assessed through numerical simulation and payoff function estimation.
In this paper, we present a Bayesian channel estimation algorithm for multicarrier receivers based on pilot symbol observations. The inherent sparse nature of wireless multipath channels is exploited by modeling the prior distribution of multipath components' gains with a hierarchical representation of the Bessel K pro…
In this work we derive local gradient and Laplacian estimates of the Aronson-Bénilan and Li-Yau type for positive solutions of porous medium equations posed on Riemannian manifolds with a lower Ricci curvature bound. We also prove similar results for some fast diffusion equations. Inspired by Perelman's work we discove…
Paper proposes a neural network method for fast, interpretable AR model estimation.
problem Computational inefficiency and convergence issues in conventional AR model estimation.
method Embeds autoregressive structure into a feedforward neural network for coefficient estimation via backpropagation.
result Neural network method consistently recovers AR model coefficients, converging in all cases and providing reliable estimates.
We provide a way to infer about existence of topological circularity in high-dimensional data sets in Rd from its projection in R2 obtained through a fast manifold learning map as a function of the high-dimensional dataset X and a particular choice of a positive real σ known as band…
New method resolves density ratio estimation saturation issues.
problem Error saturation in density ratio estimation methods.
method Iterated regularization to improve kernel methods.
result Achieves fast error rates on regular learning problems.
We study the fast diffusion equation (FDE) with a linear forcing term under the Ricci flow on complete manifolds with bounded curvature and nonnegative curvature operator. We prove Aronson-Bénilan and Li-Yau-Hamilton type differential Harnack estimates for positive solutions of the FDE. In addition, we use similar meth…
We prove the sharp local L^1 - L^\infty smoothing estimate for the logarithmic fast diffusion equation, or equivalently, for the Ricci flow on surfaces. Our estimate almost instantly implies an improvement of the known L^p - L^\infty estimate for p larger than 1. It also has several applications in geometry, providing …
The paper analyzes reinforcement learning methods for estimating weights and quality functions with fast convergence rates.
problem Estimating weights and quality functions in reinforcement learning with function approximation.
method The paper uses minimax methods for estimating marginal importance weights and q-functions.
result The minimax approach enables fast rates of convergence for weights and quality functions, achieving first-order efficiency.
A new imputation method MissARF uses adversarial random forests for fast and accurate missing value imputation.
problem Handling missing values in biostatistical analyses.
method Adversarial Random Forests (ARF) for density estimation and data synthesis.
result MissARF performs comparably to state-of-the-art methods in imputation quality and runtime.
Fast, fully-automated histograms for large data sets.
problem Efficiently constructing histograms for large-scale data.
method G-Enum histograms using Minimum Description Length (MDL) principle for model selection and a greedy search heuristic.
result Construct histograms in linearithmic time, significantly faster than previous methods.
Paper offers a fast convergence theory for offline decision making.
problem Offline decision making problems, including reinforcement learning and off-policy evaluation.
method Introduces a framework (DMOF) and algorithm (EDD) with a fast convergence guarantee.
result Demonstrates a fast convergence guarantee with a lower bound complement.
FIDDLE uses deep learning to estimate ATE from complex data.
problem Estimating ATE from high-dimensional, correlated covariates with sparse nonlinear effects.
method Factor-augmented deep learning for propensity and outcome models.
result FIDDLE consistently estimates ATE under model misspecification and is semiparametrically efficient.
We present a fast variational Bayesian algorithm for performing non-negative matrix factorisation and tri-factorisation. We show that our approach achieves faster convergence per iteration and timestep (wall-clock) than Gibbs sampling and non-probabilistic approaches, and do not require additional samples to estimate t…
This paper proposes a new method for estimating sparse precision matrices in the high dimensional setting. It has been popular to study fast computation and adaptive procedures for this problem. We propose a novel approach, called Sparse Column-wise Inverse Operator, to address these two issues. We analyze an adaptive …
Time delay estimation (TDE) is a critical and challenging step in all ultrasound elastography methods. A growing number of TDE techniques require an approximate but robust and fast method to initialize solving for TDE. Herein, we present a fast method for calculating an approximate TDE between two radio frequency (RF) …
The paper analyzes SBL pruning criteria under weakened assumptions.
problem Sparse Bayesian learning hyperparameter divergence and pruning.
method Analyzing marginal likelihood function under weakened Gaussian assumptions.
result Conditions for finite vs infinite hyperparameters lead to F-SBL pruning.
This paper introduces a simple and efficient density estimator that enables fast systematic search. To show its advantage over commonly used kernel density estimator, we apply it to outlying aspects mining. Outlying aspects mining discovers feature subsets (or subspaces) that describe how a query stand out from a given…
A new method for estimating large-scale linear models with improved precision.
problem Estimating large-scale linear statistical models efficiently.
method Sequential Least-Squares Estimators with Fast Randomized Sketching (SLSE-FRS), integrating Sketch-and-Solve and Iterative-Sketching methods.
result SLSE-FRS produces high-precision estimators, outperforming state-of-the-art methods.
FAST-DAD distills complex ensemble models into faster, more accurate individual models.
problem Deploying complex AutoML ensemble predictors on tabular data is slow, large, and opaque.
method Data augmentation strategy based on Gibbs sampling from a self-attention pseudolikelihood estimator.
result FAST-DAD distillation produces significantly better individual models than standard training.
Develops a new framework for estimating joint probability distributions.
problem Estimating joint probability distributions from large sample sizes.
method Tensor product reproducing kernel Hilbert spaces (RKHS) with normalized and positive model.
result Fast computation and applicability to prediction and classification problems.
New scalable Lipschitz bounds improve neural network robustness analysis.
problem Computing tight Lipschitz bounds for deep neural networks is challenging and computationally expensive.
method Derived new closed-form Lipschitz bounds using more general feasible points of LipSDP, avoiding SDP solvers.
result Improved scalability and precision of Lipschitz estimation for large neural networks.
In this paper we develop a Bayesian procedure for estimating multivariate stochastic volatility (MSV) using state space models. A multiplicative model based on inverted Wishart and multivariate singular beta distributions is proposed for the evolution of the volatility, and a flexible sequential volatility updating is …
A fast method estimates group-adaptive elastic net penalties using co-data.
problem Computational inefficiency in estimating group-adaptive elastic net penalties.
method Derive low-dimensional representation of Taylor approximation for marginal likelihood and its derivative for group-adaptive ridge penalties; approximate elastic net marginal likelihood by ridge; transform ridge penalties to elastic net penalties.
result Significantly decreases computation time and outperforms other methods.
An infinitely wide model is a weighted integration ∫φ(x,v)dμ(v) of feature maps. This model excels at handling an infinite number of features, and thus it has been adopted to the theoretical study of deep learning. Kernel quadrature is a kernel-based numerical integration scheme developed for fast approxi…
A-BLINK speeds up Gaussian process covariance estimation.
problem Slow covariance matrix inversion in Gaussian processes.
method Two pre-trained neural networks learn Kriging weights and spatial variance.
result Significant computational speedups and posterior inference.
We develop and implement a novel fast bootstrap for dependent data. Our scheme is based on the i.i.d. resampling of the smoothed moment indicators. We characterize the class of parametric and semi-parametric estimation problems for which the method is valid. We show the asymptotic refinements of the proposed procedure,…
A fast algorithm selects best subsets in high-dimensional models.
problem Identifying sparse models in high-dimensional generalized linear models.
method Splicing technique for fast and consistent best subset selection.
result Our algorithm achieves high certainty in selecting best subsets with polynomial computational complexity.
This thesis advances algorithms and software for QMC, GP, and sciML.
problem Efficient high-dimensional integration, interpolation, and PDE modeling.
method Developed new algorithms and software for QMC, GP, and sciML.
result Efficient and accurate methods for high-dimensional problems.
New algorithms for approximating stochastic processes efficiently.
problem Finding accurate finite approximations for stochastic processes.
method Develops new algorithms and fast implementations for approximating stochastic processes.
result Efficient approximations for stochastic processes can be found.
A fast method for LOOCV in k-NN regression reduces computation time.
problem Efficient computation of LOOCV for k-NN regression.
method Identical LOOCV estimate to (k+1)-NN MSE on training data.
result LOOCV computation can be done with (k+1)-NN regression once.