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

Trend · papers per month

17345168 · Jun 202019922001200920172026
48 results for inferential considerations

As datasets capturing human choices grow in richness and scale -- particularly in online domains -- there is an increasing need for choice models that escape traditional choice-theoretic axioms such as regularity, stochastic transitivity, and Luce's choice axiom. In this work we introduce the Pairwise Choice Markov Cha…

2016-03-08abs ↗pdf ↗

With the proliferation of mobile devices and the internet of things, developing principled solutions for privacy in time series applications has become increasingly important. While differential privacy is the gold standard for database privacy, many time series applications require a different kind of guarantee, and a…

2017-07-10abs ↗pdf ↗

Chiseling finds valid subgroups interactively, improving on existing methods.

problem Finding valid subgroups with inferential guarantees in regression and causal inference.
method Interactive subgroup refinement with inferential validity guarantees.
result Chiseling identifies better subgroups than existing methods with inferential guarantees.

Understanding the effect of a particular treatment or a policy pertains to many areas of interest, ranging from political economics, marketing to healthcare. In this paper, we develop a non-parametric algorithm for detecting the effects of treatment over time in the context of Synthetic Controls. The method builds on c…

2019-04-02abs ↗pdf ↗

Study trade-offs between statistical and computational efficiency in variational inference.

problem Optimizing statistical accuracy vs. computational efficiency in Bayesian inference.
method Case study on Gaussian inferential models with diagonal plus low-rank precision matrices, analyzing Bayesian posterior inference and frequentist uncertainty quantification errors.
result Lower-rank models reduce variance and accelerate convergence but increase posterior inference error.

This paper explores using SSIM for better image generation in generative models.

problem Improving perceptual quality in generated images using 2\ell_2 norm.
method Theoretical discussion and practical implementation of SSIM in generative models and autoencoders.
result SSIM can be used in generative models and autoencoders to generate better images.

Prediction of future observations is an important and challenging problem. The two mainstream approaches for quantifying prediction uncertainty use prediction regions and predictive distributions, respectively, with the latter believed to be more informative because it can perform other prediction-related tasks. The st…

2020-01-24abs ↗pdf ↗

The paper explores how invertibility affects the complexity of encoder models in VAEs.

problem The complexity of the encoder model in VAEs when the generative map is invertible.
method Formalizes the concept of strong invertibility and analyzes the complexity of the encoder model.
result Strongly invertible generative maps allow for simpler encoder models, while non-invertible maps require exponentially larger encoders.

Breiman's paper sparked debate on the future of statistics and machine learning.

problem The tension between traditional statistical modeling and model-free machine learning approaches.
method Discussion of the implications of machine learning's success and the need for new inferential approaches.
result The importance of understanding 'why' and 'if' questions in machine learning is now recognized.

The Unlearning algorithm improves neural network performance in memory tasks.

problem Improving neural network performance in memory tasks.
method Simplified Unlearning algorithm, structured training data, and new regularization technique for Boltzmann Machines.
result The Unlearning rule outperforms traditional Boltzmann-Machine learning in learning hidden probability distributions.

New strategy debiases synthetic data generated by DGMs for improved statistical inference.

problem Bias and imprecision in synthetic data generated by DGMs impede statistical convergence and inference.
method Debiasing strategy based on debiased and targeted machine learning.
result Enhanced convergence rates and accurate estimators with easily approximated variances.

Paper examines LLM capability benchmarks through construct validity, favoring nomological account.

problem Linking theoretical capabilities to empirical measurements in LLMs.
method Contrasts three frameworks: nomological, inferential, and causal.
result Nomological account provides best foundation for LLM research.

Ordinary least square (OLS) estimation of a linear regression model is well-known to be highly sensitive to outliers. It is common practice to (1) identify and remove outliers by looking at the data and (2) to fit OLS and form confidence intervals and p-values on the remaining data as if this were the original data col…

2017-11-29abs ↗pdf ↗

Paper develops methods for statistical inference with SGD in nonconvex optimization.

problem Statistical inference for nonconvex optimization problems.
method Proposes two online inferential procedures combining SGD and bootstrap techniques.
result Establishes error convergence rates and asymptotically valid bootstrap confidence intervals.

We consider the problem of undirected graphical model inference. In many applications, instead of perfectly recovering the unknown graph structure, a more realistic goal is to infer some graph invariants (e.g., the maximum degree, the number of connected subgraphs, the number of isolated nodes). In this paper, we propo…

2017-07-28abs ↗pdf ↗

Simple method for estimating missing panel data entries with confidence intervals.

problem Estimating missing values in panel data with staggered adoption.
method Simple matrix algebra and singular value decomposition for estimation, with data-driven confidence intervals.
result Confidence intervals match non-asymptotic lower bounds, proving instance optimality.

Recent decades have seen an interest in prediction problems for which Bayesian methodology has been used ubiquitously. Sampling from or approximating the posterior predictive distribution in a Bayesian model allows one to make inferential statements about potentially observable random quantities given observed data. Th…

2015-07-22abs ↗pdf ↗

The growing size of modern data brings many new challenges to existing statistical inference methodologies and theories, and calls for the development of distributed inferential approaches. This paper studies distributed inference for linear support vector machine (SVM) for the binary classification task. Despite a vas…

2018-11-29abs ↗pdf ↗

In many application settings, the data have missing entries which make analysis challenging. An abundant literature addresses missing values in an inferential framework: estimating parameters and their variance from incomplete tables. Here, we consider supervised-learning settings: predicting a target when missing valu…

2019-02-19abs ↗pdf ↗

How should statistical procedures be designed so as to be scalable computationally to the massive datasets that are increasingly the norm? When coupled with the requirement that an answer to an inferential question be delivered within a certain time budget, this question has significant repercussions for the field of s…

2013-09-30abs ↗pdf ↗

In high-dimensional linear models, the sparsity assumption is typically made, stating that most of the parameters are equal to zero. Under the sparsity assumption, estimation and, recently, inference have been well studied. However, in practice, sparsity assumption is not checkable and more importantly is often violate…

2016-10-07abs ↗pdf ↗

This work improves mixing rates for Bayesian CART, a key component of BART.

problem Understanding and improving mixing rates for Bayesian inference with MCMC.
method Derived upper bounds on mixing times, provided sufficient conditions for polynomial mixing, and proposed Twiggy Bayesian CART.
result Twiggy Bayesian CART achieves polynomial mixing without assuming signal connectivity.

This paper develops embeddings that preserve likelihood-based statistical inference.

problem Modern machine learning embeddings destroy the geometric structure required for likelihood-based inference.
method Developed a rigorous theory of likelihood-preserving embeddings and introduced the Likelihood-Ratio Distortion metric.
result Controlling the distortion ΔnΔ_n is necessary and sufficient for preserving inference.

New approaches improve uncertainty quantification in autoregressive models for sequence data.

problem Uncertainty quantification in autoregressive models for exchangeable sequences.
method Study of inferential and architectural biases for autoregressive models, focusing on multi-step inference.
result Custom architectures are necessary for multi-step inference to ensure exchangeability.

Deep learning (DL) is a high dimensional data reduction technique for constructing high-dimensional predictors in input-output models. DL is a form of machine learning that uses hierarchical layers of latent features. In this article, we review the state-of-the-art of deep learning from a modeling and algorithmic persp…

2018-07-20abs ↗pdf ↗

Post-ADC inference corrects bias in statistical inference after active data collection.

problem Bias in inference after active data collection.
method Post-ADC inference framework that corrects bias from both ADC process and data-driven target construction.
result Valid inference for data collected by SMBO methods like GP-UCB and TPE.

Proposes a semi-Bayesian nonparametric estimator for MMD in GOF tests and GANs.

problem Challenges in goodness-of-fit testing for intractable models.
method Semi-Bayesian nonparametric estimator of MMD.
result Outperforms frequentist MMD-based methods in false rejection and acceptance rates.

PAIR-CI calibrates CI tests for causal discovery with incomplete data.

problem Miscalibration of CI tests when imputing incomplete data.
method Integrates multiple imputation directly into the inferential procedure via a paired permutation design.
result PAIR-CI reduces false positive rates to below 5% in simulations.

Privacy-preserving synthetic data from EHRs for learning and inference.

problem Sharing sensitive EHR data while maintaining patient privacy.
method Differentially private normalizing flows for density estimation and variational inference.
result Privacy-preserving synthetic data can yield good utility at a reasonable privacy cost.