New method improves crowdsourcing efficiency and inference of problem properties.
problem Crowdsourcing allocation strategies introduce bias, affecting inference of task difficulty and worker properties.
method Decision-Explicit Probability Sampling (DEPS) to infer problem properties accurately.
result DEPS outperforms baseline methods in inferring problem properties while maintaining efficiency gains.
Paper introduces attacks to infer GAN training dataset properties.
problem Security and privacy risks of generative models like GANs.
method Proposes a general attack pipeline for two attack scenarios.
result Demonstrates strong performance in inferring GAN training dataset properties.
Proposes a method to infer ranking properties and top-K rankings with uncertainty quantification.
problem General uncertainty quantification in ranking problems.
method Combinatorial inference framework for the Bradley-Terry-Luce model, generalized to multiple testing.
result Minimax optimal method for inferring top-K rankings with FDR control.
Framework for interpreting ML models to reveal properties of real-world phenomena.
problem Lack of direct interpretability in modern ML models hinders scientific understanding.
method Developed 'property descriptors' grounded in statistical learning theory.
result Property descriptors can reveal relevant properties of joint probability distributions.
This paper analyzes how data and model properties affect membership inference attacks.
problem Understanding and mitigating the vulnerability of machine learning models to membership inference attacks.
method Empirical analysis of data and model properties on MIA success.
result Data and model properties, not just model overfitting, influence MIA success.
Variational inference is a popular technique to approximate a possibly intractable Bayesian posterior with a more tractable one. Recently, boosting variational inference has been proposed as a new paradigm to approximate the posterior by a mixture of densities by greedily adding components to the mixture. However, as i…
New algorithms improve likelihood of finding global optima in Bayesian inference.
problem Finding global optima in Bayesian inference is difficult due to nonconvexity.
method Developed two algorithms: consistent Laplace approximation (CLA) and consistent stochastic variational inference (CSVI).
result Both CSVI and CLA improve likelihood of obtaining global optima compared to standard methods.
A debiasing method improves nonparametric regression's statistical properties.
problem Lack of theoretical guarantees for modern nonparametric regression methods.
method Model-free debiasing method incorporating a correction term.
result Debiased estimator satisfies pointwise and uniform risk convergence, asymptotic normality.
Paper studies estimating network properties with missing data using SRL and GNN.
problem Estimating aggregate properties in networks with missing data attributes.
method Comparative study of SRL and GNN approaches for inferring missing attributes and estimating aggregate properties.
result SRL-based approaches tend to outperform GNN-based approaches in estimating aggregate properties and predictive accuracy.
Unified framework for efficient data augmentation models.
problem Improving convergence and computational efficiency of inference methods.
method Asymptotically exact data augmentation (AXDA) framework.
result AXDA models offer efficient inference algorithms and interesting statistical properties.
Paper tackles high-order inference in structured prediction tasks.
problem Maximizing a score function on the space of labels in high-order Markov random fields.
method Generative model approach with two-stage convex optimization algorithm.
result Success in general high-order inference problems driven by hyperedge expansion properties.
Hybridizes physical and data-driven methods for predicting physicochemical properties.
problem Predicting physicochemical properties accurately using limited data.
method Distills physical method predictions into a prior model and combines with sparse experimental data using Bayesian inference.
result Significant improvements in predicting activity coefficients at infinite dilution compared to baselines and ensemble methods.
Variational inference is an umbrella term for algorithms which cast Bayesian inference as optimization. Classically, variational inference uses the Kullback-Leibler divergence to define the optimization. Though this divergence has been widely used, the resultant posterior approximation can suffer from undesirable stati…
A VAE model predicts material properties and microstructures.
problem Building forward and inverse structure-property linkages in materials science.
method Combines VAE with regression, using a two-level prior and multi-modal Gaussian mixture.
result The model achieves accurate forward and inverse predictions of material properties and microstructures.
We propose a novel interpretation of the collapsed variational Bayes inference with a zero-order Taylor expansion approximation, called CVB0 inference, for latent Dirichlet allocation (LDA). We clarify the properties of the CVB0 inference by using the alpha-divergence. We show that the CVB0 inference is composed of two…
We assume that a high-dimensional datum, like an image, is a compositional expression of a set of properties, with a complicated non-linear relationship between the datum and its properties. This paper proposes a factorial mixture prior for capturing latent properties, thereby adding structured compositionality to deep…
The study investigates how data variability impacts the generalization of neural networks.
problem Understanding the impact of data variability on neural network generalization.
method Developed a field-theoretic formalism to compute generalization properties of neural networks, focusing on data variability.
result Data variability leads to non-Gaussian action, affecting the learning curve and generalization properties of neural networks.
Paper develops robust methods for panel data with latent groups, improving inference under group separation violations.
problem Inference in latent group panel models under group separation violations.
method Selective conditional inference approach to derive conditional distribution of coefficients given estimated group structure.
result Valid inference under violations of group separation, superior to traditional asymptotic methods.
This paper addresses metaconsistency in Bayesian inference for metastable systems.
problem Inference for metastable systems may not be consistent, but can be metaconsistent over large but finite time intervals.
method Introduces metaconsistency in a Bayesian framework, discusses its relation to spectral properties of model dynamics.
result Metaconsistency can be exploited to infer sub-systems efficiently from larger systems.
Efficient algorithm for Bayesian networks reduces marginal probability distribution computation.
problem Exact computation of marginal probability distribution is NP-hard for categorical variables in Bayesian networks.
method Divide-and-conquer approach exploiting graphical properties of Bayesian networks.
result Novel algorithm outperforms state-of-the-art methods in classification and cancer subtype identification.
ALMGIG uses adversarial learning to generate and infer novel molecules efficiently.
problem Efficiently generating and inferring novel molecules using graph representations.
method Adversarial learning framework that avoids explicit graph isomorphism, using cycle-consistency loss and multi-graph Graph Isomorphism Network.
result ALMGIG more accurately learns the distribution over the space of molecules and efficiently searches the molecular space.
Paper bounds tensor decomposition's RLCT, aiding Bayesian inference.
problem Unclear mathematical property of tensor decomposition.
method Algebraic geometrical method for upper bound derivation.
result Upper bound of real log canonical threshold (RLCT) derived.
Survey on statistical inference under memory constraints.
problem Effect of memory limitations on statistical inference performance.
method Review of state-of-the-art in several canonical problems.
result Identification of fundamental building blocks and useful techniques.
Bayesian framework integrates spectral deconvolution with expert reasoning for robust peak estimation.
problem Challenges in extracting meaningful peaks from noisy or complex spectra.
method Bayesian spectral deconvolution coupled with a physical-property regression layer.
result Recovery of weak peaks in poly(lactic acid) IR spectra related to degradation rates.
A new method combines variational inference and MCMC for efficient data subsampling.
problem Combining variational inference and MCMC for data subsampling.
method Introduces a surrogate likelihood to learn jointly with variational parameters.
result Permits an intuitive trade-off between inference fidelity and computational cost.
Framework uses diffusion models to infer material properties from noisy mechanical measurements.
problem Inference of spatially varying material properties from noisy mechanical responses.
method Conditional score-based diffusion models approximating the score function of a conditional distribution.
result Framework can efficiently solve large-scale physics-based inverse problems.
The article proposes a deep learning method to test and infer the Markov property in time series data.
problem Testing and inferring the Markov property in high-dimensional time series data.
method Deep conditional generative learning to estimate conditional density functions and derive a doubly robust test statistic.
result The test controls the type-I error asymptotically and has power approaching one.
Approximate inference algorithm is one of the fundamental research fields in machine learning. The two dominant theoretical inference frameworks in machine learning are variational inference (VI) and Markov chain Monte Carlo (MCMC). However, because of the fundamental limitation in the theory, it is very challenging to…
Paper proposes Walsh-Hadamard Variational Inference for efficient approximate inference in large models.
problem Over-regularization in variational inference for large models.
method Walsh-Hadamard factorization strategies to reduce parameterization, accelerate computations, and increase posterior expressiveness.
result Efficient approximate inference achieved in over-parameterized models.
Geometric analysis improves convergence of variational inference.
problem Challenges in analyzing convergence of variational inference due to non-convexity and non-smoothness.
method Exploits exponential family structure and Bregman divergences to geometrically analyze the optimization landscape.
result Establishes non-asymptotic convergence rates for gradient descent algorithms.
New analysis shows LLMs don't follow Bayesian inference in ICL.
problem Does in-context learning in LLMs follow Bayesian inference?
method Analyzes ICL through the martingale property, a requirement for Bayesian inference.
result Violations of the martingale property show LLMs don't follow Bayesian inference.
New algorithm radVI improves variational inference by optimizing radial profiles.
problem Gaussian approximations often fail to capture the radial profile of complex distributions.
method Optimizes over radial profiles in variational inference, providing theoretical guarantees.
result Theoretical convergence guarantees for radVI, improving over existing VI methods.
Bayesian Algorithm Execution uses mutual information to infer properties of black-box functions efficiently.
problem Estimating computable properties of expensive black-box functions with limited evaluations.
method Sequentially choosing queries that maximize mutual information with respect to the algorithm's output.
result InfoBAX reduces query counts by up to 500 times compared to the original algorithm.
AKO improves stability and power of Knockoff inference.
problem Instability of Knockoff-based inference.
method Aggregation of Multiple Knockoffs (AKO) method.
result AKO maintains FDR control while improving stability and power.
New framework for inference with LAR, explaining variable contributions and providing stopping rules.
problem LAR's lack of well-understood termination point and basic behavioral properties.
method Developed a novel framework for inference with LAR, providing new mathematical properties and stopping rules.
result LAR estimates of non-zero population correlations have independent normal distributions for inference, and zero-valued correlations have a non-normal joint distribution.
WNVI solves inverse problems without forward models using neural networks.
problem Solving high-dimensional Bayesian inverse problems based on PDEs.
method WNVI uses weighted residuals and SVI with neural networks to infer state variables and unknowns.
result WNVI is more accurate and efficient than traditional methods and handles ill-posed problems.
The paper develops a method for inferring second opinions from experts using counterfactual inference.
problem Designing efficient decision support systems for second opinions.
method Set invariant Gumbel-Max structural causal model for multiclass classification.
result The proposed model can infer second opinions more accurately than non-causal models.
C-Learner improves stability of plug-in estimators for causal inference.
problem Limited overlap between treatment and control groups leads to unstable estimates.
method Constrained learning framework that achieves stability and asymptotic properties.
result Constrained learning produces stable estimates with desirable asymptotic properties.
The paper studies continuous submodular functions and their optimization.
problem Maximizing continuous submodular functions in poly. time.
method Characterization of continuous submodularity, operations preserving it, and algorithms for constrained maximization.
result Continuous submodularity is equivalent to a weak DR property, leading to continuous DR-submodular functions with the full DR property.
We introduce incremental variational inference and apply it to latent Dirichlet allocation (LDA). Incremental variational inference is inspired by incremental EM and provides an alternative to stochastic variational inference. Incremental LDA can process massive document collections, does not require to set a learning …
Bayesian inference identifies model parameters from financial data to detect arbitrage opportunities.
problem Identifying model parameters from financial data to detect arbitrage opportunities.
method Bayesian inference approach using Markov Chain Monte Carlo (MCMC) algorithm.
result Bayesian inference can estimate unknown trend and volatility coefficients from measured data.
Novel Bayesian framework for spatio-temporal neuroimaging data.
problem Inference on multi-task sparse hierarchical regression models with complex spatio-temporal dynamics.
method Flexible hierarchical Bayesian framework with Kronecker product covariance structure, majorization-minimization optimization, and Riemannian geometry.
result Improved performance on synthetic and real M/EEG data.
We present a new, fully generative model for constructing astronomical catalogs from optical telescope image sets. Each pixel intensity is treated as a random variable with parameters that depend on the latent properties of stars and galaxies. These latent properties are themselves modeled as random. We compare two pro…
ESS-Flow guides flow models without retraining, using Bayesian inference in source space.
problem Training flow models on paired data for conditional generation or sample production.
method Gradient-free Bayesian inference in source space using Elliptical Slice Sampling.
result Effective in diverse tasks including material design and protein structure prediction.
New method uses SBI to infer magnetorotational properties of isolated pulsars.
problem Constrain magnetorotational properties of isolated Galactic radio pulsars.
method Combines population synthesis with SBI to model neutron star birth and evolution.
result Inferred μlogB=13.10−0.10+0.08, σlogB=0.45−0.05+0.05 for lognormal distributions. Bayesian inference for wide neural networks using Edgeworth expansion.
problem Analyzing the non-Gaussian behavior of wide neural networks in Bayesian inference.
method Proposed a non-Gaussian distribution using multivariate Edgeworth expansion for finite-width neural networks.
result Derived non-Gaussian posterior distribution in Bayesian regression tasks.
GIM learns by analogy to improve reinforcement learning efficiency.
problem Efficient reinforcement learning with limited data.
method GIM infers unknown dynamics from known dynamics based on spectral properties.
result GIM achieves lower sample complexity and computational efficiency.
A new variational inference method using sliced Wasserstein distance is proposed.
problem The inefficiency and unreasonable properties of Kullback-Leibler divergence.
method Minimizing sliced Wasserstein distance, a valid metric from optimal transport.
result The proposed method approximates the unnormalized distribution efficiently and without requiring a tractable density function.