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

82164246328 · Jun 202019922001200920172026
48 results for large-scale inference

New method infers causal factors from large-scale data without full graph reconstruction.

problem Inferring causal variables from large-scale systems without full causal graph reconstruction.
method Supervised learning on simulated data using a neural network and subsampled-ensemble inference.
result Efficiently identifies causal relationships in large-scale gene regulatory networks.

This paper proposes a new method for learning covers of geometric datasets to improve topological inference and visualization.

problem Improving topological inference and visualization of large-scale geometric datasets.
method Proposes a method for learning topologically-faithful covers of geometric datasets using optimization.
result Simplicial complexes obtained from learned covers outperform standard methods in terms of size and representation of large-scale topology.

Paper presents a fast, private MH algorithm for large-scale Bayesian inference.

problem Privacy-preserving Bayesian inference for large-scale data.
method Developed a novel DP-MH algorithm using minibatches.
result First exact and fast DP MH algorithm with privacy, scalability, and efficiency trade-offs.

Proposes two-stage robust and sparse distributed inference for large-scale data.

problem Statistical inference in large-scale, high-dimensional, and outlier-contaminated data.
method Two-stage approach: model selection with robust Lasso, fusion of local selections, and bootstrap methods for inference.
result Robust and computationally efficient inference procedures for variable selection, confidence intervals, and standard deviation approximations.

For large scale on-line inference problems the update strategy is critical for performance. We derive an adaptive scan Gibbs sampler that optimizes the update frequency by selecting an optimum mini-batch size. We demonstrate performance of our adaptive batch-size Gibbs sampler by comparing it against the collapsed Gibb…

2018-01-27abs ↗pdf ↗

PAVI speeds up VI for large-scale studies by sharing parameterization across i.i.d. variables.

problem Challenges in Bayesian inference for large population studies with many latent parameters.
method Designing plate-amortized variational inference (PAVI) to share parameterization across i.i.d. variables.
result Significant speedup in training large-scale hierarchical variational distributions.

New algorithm speeds up large-scale statistical inference.

problem Efficiently solving large-scale mean-field variational inference problems.
method Developed a novel primal-dual algorithm (PD-VI) and a block-preconditioned extension (P2^2D-VI) for mean-field variational inference.
result PD-VI and P2^2D-VI achieve faster convergence and better solution quality compared to existing methods.

New method estimates bidirectional causal effects in large-scale systems.

problem Estimating bidirectional causal effects in systems with mutual dependence and heteroskedasticity.
method Heteroskedasticity-based identification with online kernel learning and random Fourier features.
result Superior accuracy and stability compared to single equation and polynomial approximations.

Drawing a sample from a discrete distribution is one of the building components for Monte Carlo methods. Like other sampling algorithms, discrete sampling suffers from the high computational burden in large-scale inference problems. We study the problem of sampling a discrete random variable with a high degree of depen…

2015-06-30abs ↗pdf ↗

We outline an inherent weakness of tensor factorization models when latent factors are expressed as a function of side information and propose a novel method to mitigate this weakness. We coin our method \textit{Kernel Fried Tensor}(KFT) and present it as a large scale forecasting tool for high dimensional data. Our re…

2020-02-11abs ↗pdf ↗

New method for scalable inference in large-scale regression models with complex error structures.

problem Challenges in statistical inference for large-scale regression models with dependent errors.
method Generalized Method of Wavelet Moments with Exogenous variables (GMWMX).
result Statistical validity and scalability of GMWMX for linear models with complex error structures.

We develop a privatised stochastic variational inference method for Latent Dirichlet Allocation (LDA). The iterative nature of stochastic variational inference presents challenges: multiple iterations are required to obtain accurate posterior distributions, yet each iteration increases the amount of noise that must be …

2016-09-14abs ↗pdf ↗

Federated learning for Bayesian clustering of large datasets.

problem Bayesian model-based clustering of large-scale binary and categorical data.
method Federated variational inference with local merge and delete moves in parallel batches, followed by global merge moves.
result Empirical validation shows superior performance compared to existing algorithms.

Deep neural networks provide meaningful uncertainty estimates for large-scale simulations.

problem Uncertainty estimates for deep neural network predictions from large-scale simulations.
method General variational inference approach to calibrate Bayesian uncertainties.
result Calibrated Bayesian uncertainties preserved physics-correlations in predicted quantities.

New method for accurate Bayesian inference in GLMMs for large-scale data.

problem Challenges in scalable Bayesian inference for GLMMs due to intractable marginal likelihood and high computational cost.
method Stochastic gradient Markov Chain Monte Carlo (SGMCMC) algorithm using Fisher's identity for gradient estimation.
result Accurate posterior inference in large-sample settings with properly calibrated uncertainty.

Bayesian inference promises to ground and improve the performance of deep neural networks. It promises to be robust to overfitting, to simplify the training procedure and the space of hyperparameters, and to provide a calibrated measure of uncertainty that can enhance decision making, agent exploration and prediction f…

2019-08-09abs ↗pdf ↗

Stochastic variational inference for collapsed models has recently been successfully applied to large scale topic modelling. In this paper, we propose a stochastic collapsed variational inference algorithm in the sequential data setting. Our algorithm is applicable to both finite hidden Markov models and hierarchical D…

2015-12-05abs ↗pdf ↗

Analyzing the urban trajectory in cities has become an important topic in data mining. How can we model the human mobility consisting of stay and travel from the raw trajectory data? How can we infer such a mobility model from the single trajectory information? How can we further generalize the mobility inference to ac…

2020-01-21abs ↗pdf ↗

Semi-supervised Generative Adversarial Networks (GANs) are developed in the context of travel mode inference with uni-dimensional smartphone trajectory data. We use data from a large-scale smartphone travel survey in Montreal, Canada. We convert GPS trajectories into fixed-sized segments with five channels (variables).…

2019-02-27abs ↗pdf ↗

CausalPFN automates causal effect estimation from observational data.

problem Manual selection of causal effect estimators is time-consuming and requires domain expertise.
method CausalPFN is a transformer that learns to infer causal effects from raw observations without task-specific adjustments.
result CausalPFN achieves superior performance on various benchmarks and real-world tasks.

We propose a method to visualize class similarity in large-scale classifiers.

problem Analyzing hierarchical structures and relationships in large-scale classification.
method Compute class similarity based on prediction scores and visualize the class similarity matrix.
result Visualizing class similarity matrices reveals hierarchical structures and relationships.

New method speeds up Gaussian process training and inference for large datasets.

problem Training and inference in Gaussian processes are computationally expensive for large datasets.
method Iterative alternating projection method that accesses subblocks of the kernel matrix, reducing time and space complexity.
result Empirically, the method accelerates GP training and inference by up to 72x compared to conjugate gradients.

New method speeds up uncertainty estimation for large datasets in causal inference.

problem Computational infeasibility of bootstrap-based uncertainty quantification for large datasets.
method Extends cBLB algorithm to kernel methods, combining subsampling and resampling.
result Achieves computational scalability with nominal coverage.

We propose a framework that directly tackles the probability distribution of the value function parameters in Deep Q Network (DQN), with powerful variational inference subroutines to approximate the posterior of the parameters. We will establish the equivalence between our proposed surrogate objective and variational i…

2017-11-30abs ↗pdf ↗

This paper examines how neural architectures support amortized Bayesian inference and its performance under varying conditions.

problem Understanding and evaluating amortized inference under signal-to-noise variation and distribution shift.
method Statistical analysis of neural architectures including feedforward networks, Deep Sets, and Transformers.
result Neural architectures support amortized Bayesian inference, offering controlled generalization error and robustness under varying conditions.

New method improves reliability of depth estimation models.

problem Uncertainty quantification in large-scale vision models.
method Parameter-efficient Bayesian neural networks with PEFT methods.
result Combining PEFT methods with Bayesian inference enhances predictive performance.

Enhanced framework selects features for unbiased causal inference.

problem Unbiased estimation of causal quantities in causal inference.
method Three-stage computational framework balancing treatment and non-treatment variables.
result Significantly reduces bias and variance in estimating causal quantities.

Hybrid continuous-discrete models naturally represent many real-world applications in robotics, finance, and environmental engineering. Inference with large-scale models is challenging because relational structures deteriorate rapidly during inference with observations. The main contribution of this paper is an efficie…

2012-10-16abs ↗pdf ↗

Paper proposes a faster SPIDER-EM variant for large-scale nonconvex optimization.

problem High computational cost of EM algorithm in large-scale learning.
method Extension of SPIDER-EM for nonconvex finite-sum optimization problems.
result Achieves state-of-the-art complexity bounds and linear convergence under certain conditions.

Method analyzes large-scale network data to detect communication pattern shifts.

problem Analyzing large-scale time-series network data is challenging.
method Temporal encoder embedding method using ground-truth or estimated vertex labels.
result Detects communication pattern shifts across all levels of network structure.

We present a novel method for frequentist statistical inference in MM-estimation problems, based on stochastic gradient descent (SGD) with a fixed step size: we demonstrate that the average of such SGD sequences can be used for statistical inference, after proper scaling. An intuitive analysis using the Ornstein-Uhlen…

2017-05-21abs ↗pdf ↗

Develop a variational framework for statistical inference on cyclic interactions.

problem Estimating and comparing large-scale recurrent organization in directed interactions.
method Represent directed interactions as edge flows on a simplicial complex and evolve under an energy-minimizing dynamical system.
result Separate transient interaction components from persistent harmonic flows, yielding a low-dimensional cycle space.

A new framework using kernel packets overcomes limitations of state space models for multi-dimensional data.

problem Computational limitations of Gaussian process regression in large-scale applications.
method Kernel packet approach, identifying KPs via forward and backward state space representations.
result Exact, memory-efficient inference with linear-time training and logarithmic/predictive time.