Paper proposes learnable topological features for efficient phylogenetic inference.
problem Finding appropriate topological structures for phylogenetic inference tasks requires significant design effort and domain expertise.
method Combines raw node features with graph neural networks to automatically adapt to different tasks.
result Demonstrates effectiveness and efficiency on simulated and real data phylogenetic inference tasks.
New method speeds up Bayesian non-parametric model inference.
problem Difficult inference in high-dimensional Bayesian non-parametric models.
method Accelerated feature proposal mechanism and parallel approximate inference.
result Can quickly reach local convergence to posterior distribution.
iLOCO measures feature interactions without assumptions, providing statistical inference.
problem Lack of methods to statistically infer feature interactions.
method iLOCO metric and LOCO inference for distribution-free, efficient computation.
result First inferential approach to detecting feature interactions.
PSI models and infers feature attributions efficiently and accurately.
problem Modeling and inferring feature attributions in flexible predictive models.
method Probabilistic Shapley inference (PSI) framework using latent random variables and a masking-based neural network architecture.
result PSI learns feature attribution distributions centered at Shapley values, revealing meaningful uncertainty.
A new method for feature importance inference without data splitting.
problem Feature importance inference for machine learning models.
method Minipatch ensembles for model-agnostic, distribution-free inference.
result Asymptotic validity of confidence intervals without data splitting.
Develops a more powerful selective inference method for stepwise feature selection.
problem Loss of power in existing conditional SI methods due to over-conditioning.
method Uses homotopy continuation approach to overcome over-conditioning.
result Shows improved power and efficiency in selective inference for feature selection.
Improves transparency of deep neural networks through feature and consistency analysis.
problem Black-box nature of deep learning inference limits transparency for safety-critical systems.
method Structural and linguistic feature analysis, consistency analysis.
result 75% of human workers found input data and results consistent, 70% found inference and results consistent.
A new parallel MCMC method for Indian Buffet Process models.
problem Slow inference in Indian Buffet Process models.
method Hybrid sampler combining collapsed and uncollapsed MCMC for parallel computation.
result Asymptotically exact parallel inference for Indian Buffet Process models.
The study sets lower bounds on MMSE for inferring sensitive features from noisy data.
problem Estimating sensitive features from noisy observations of correlated features.
method Adversarial evaluation framework based on MMSE estimation with theoretical lower bounds.
result Derives closed-form bounds for linear models, showing optimality in noise variance.
VISR learns controllable features for fast task inference.
problem Generalizing behaviors beyond explicitly learned set for subsequent tasks.
method Combines Successor Features and Variational Inference.
result Achieves human-level performance on 14 Atari games.
Mobile phone data predicts users' income levels.
problem Predicting users' income levels from mobile phone data.
method Comparison of feature extraction methods and machine learning techniques.
result Bayesian method based on the communication graph outperforms other methods.
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.
New neural network method hides input information in complex-valued features to protect privacy.
problem Preventing adversaries from inferring input attributes from neural network features.
method Transforming real-valued features into complex-valued ones, making input hidden in a randomized phase.
result Significantly diminishes adversary's ability to infer input while preserving high accuracy.
Proposes a new method to improve selective inference for Lasso models.
problem Over-conditioning due to conditioning on feature signs in selective inference for Lasso.
method Parametric programming approach to avoid conditioning on signs and identify feature selection events.
result Improves power and practicality of selective inference for Lasso models.
Neural network feature optimization for causal inference.
problem Estimating heterogeneous treatment effects from data.
method Genetic algorithm optimization of intermediate neural network layers for feature representations.
result Retains useful features for outcome prediction even if related to treatment assignment.
Paper proposes a statistical test for feature selection pipelines using selective inference.
problem Assessing the significance of feature selection pipelines in data analysis.
method Selective inference technique applied to feature selection pipelines composed of various algorithms.
result The proposed statistical test controls false positive feature selection probabilities.
New method trains DGP models with random feature expansions for scalable inference.
problem Scalability and inference complexity in Deep Gaussian Processes.
method Random feature expansions combined with stochastic variational inference.
result Significantly advanced inference for Deep Gaussian Processes, scalable to large datasets.
A new Gaussian process framework uses neural feature maps for scalable, accurate inference.
problem Efficient and accurate Gaussian process inference for diverse data types.
method Neural feature maps to construct expressive kernels, with theoretical guarantees and practical scalability.
result The approach outperforms existing methods in accuracy and efficiency across various data modalities.
A novel model uses ODE-based random features to model nonlinear dynamical systems.
problem Modeling highly nonlinear dynamical systems with uncertainty quantification.
method Compositions of physics-informed random features derived from ODEs, combined with deep Gaussian processes and approximate Bayesian inference.
result The model effectively captures nonlinear behavior in real-world multivariate time series data and achieves comparable performance to other models on benchmark tasks.
A framework infers feature importance with uncertainties for high-dimensional data.
problem Estimating feature importance in high-dimensional data with uncertainty.
method Shapley value based framework, sub-SAGE, bootstrapping.
result Uncertainties in feature importance can be estimated from bootstrapping.
New features reduce computational cost of variational inference.
problem Efficiently compute ELBO with reduced computational cost.
method Developed features that reduce O(M3) to O(ildeNT+MT) for large M. result Unbiased ELBO estimation with reduced computational complexity.
Automatically learns summary features from time series data for likelihood-free inference.
problem Necessity of hand-tailored summary features for time series data in likelihood-free inference.
method Data-driven approach to automatically learn summary features.
result Learning summary features from data can outperform hand-crafted values in likelihood-free inference.
Cross-balancing improves causal inference by balancing features with outcome data.
problem Balancing features for valid causal inference when outcome data is available.
method Cross-balancing using sample splitting to separate feature construction and weight estimation errors.
result Cross-balancing produces consistent, asymptotically normal, and efficient estimators under mild conditions.
Paper presents a MapReduce method for feature selection in large datasets.
problem Feature selection in high-dimensional datasets.
method Distributed MapReduce implementation of Minimum Redundancy Maximum Relevance algorithm.
result Scalable feature selection on datasets with millions of observations or features.
This paper provides a guide to feature importance methods for better scientific inference.
problem Limited understanding of data-generating process due to opaque ML model mechanisms.
method Comprehensive review and new proofs of global feature importance methods.
result Facilitates a thorough understanding and concrete recommendations for FI methods.
Reduces risk of model inversion by reducing sensitive feature influence.
problem Model inversion attacks reveal sensitive individual data from trained models.
method Privacy-guided training to reduce sensitive feature influence in tree-based models.
result Training models to reduce sensitive feature influence reduces the risk of inference attacks.
One-bit quantization improves inference speed for Random Features models.
problem Efficient inference on resource-constrained devices.
method Analysis of one-bit quantization in Random Features model.
result Asymptotically, quantizing weights except the last incurs no loss in generalization error.
CIT and CIF improve feature selection for downstream prediction.
problem Feature selection bias in machine learning models.
method Conditional inference trees and forests with Bonferroni correction.
result CIF ranks top 3 among 18 regression methods and top 4 among 17 classification methods.
Inference for latent feature models is inherently difficult as the inference space grows exponentially with the size of the input data and number of latent features. In this work, we use Kurihara & Welling (2008)'s maximization-expectation framework to perform approximate MAP inference for linear-Gaussian latent featur…
A new method explains mixed features for predictive models using conditional inference trees.
problem Explaining complex machine learning models with mixed features.
method Proposes a method to explain mixed features (continuous, discrete, ordinal, categorical) using conditional inference trees.
result Our method often outperforms current industry standards in various simulation studies and real-world financial data.
Framework disentangles deep feature uncertainty for efficient inference.
problem Inference-time uncertainty estimation for reliable decision-making.
method Uncertainty-Guided Inference-Time Selection framework.
result Significantly tighter prediction intervals and 60% compute reduction.
Paper introduces PTL-SI for statistical inference in TL-HDR, controlling FPR.
problem Quantifying statistical significance in TL-HDR with limited data.
method PTL-SI framework for valid p-values in TL-HDR feature selection. result Valid p-values and controlled FPR in TL-HDR feature selection. Bayesian TNKMs automatically infer model complexity and feature relevance.
problem Manual tuning of TN rank and feature dimensions is error-prone and computationally expensive.
method Bayesian approach with hierarchical priors on TN factors for automatic rank and feature selection.
result Superior performance in prediction accuracy, uncertainty quantification, interpretability, and scalability.
We present a max-margin nonparametric latent feature model, which unites the ideas of max-margin learning and Bayesian nonparametrics to discover discriminative latent features for link prediction and automatically infer the unknown latent social dimension. By minimizing a hinge-loss using the linear expectation operat…
New test assesses reliability of auto-generated features.
problem Lack of reliable assessment for auto-generated features.
method Selective inference framework for statistical testing.
result Proposes a statistical test for auto-generated features in linear models.
We consider analysis of relational data (a matrix), in which the rows correspond to subjects (e.g., people) and the columns correspond to attributes. The elements of the matrix may be a mix of real and categorical. Each subject and attribute is characterized by a latent binary feature vector, and an inferred matrix map…
Enhances DGPs with adaptive RKHS Fourier features for better non-stationary pattern modeling.
problem Capturing complex non-stationary patterns in non-linear dynamical systems.
method Integrates ODE-based RKHS Fourier features into DGPs using convolution operations for adaptive amplitude and phase modulation. Uses a doubly stochastic variational inference framework.
result Improved predictive performance across various regression tasks.
Paper proposes using pairwise feature comparisons to infer modification costs for user recourse.
problem Learning and inferring user preferences for modifying features in black-box models.
method Bradley-Terry model for inferring feature-wise costs from non-exhaustive human comparison surveys.
result Non-exhaustive human surveys can efficiently learn feature costs, enabling recourse finding.
Developed a Particle-Gibbs sampler for Bayesian feature allocation models.
problem Intractable exact inference in Bayesian feature allocation models.
method Particle-Gibbs sampler for feature allocation matrix updates.
result PG sampler improves performance of feature allocation models.
MetaVRF learns adaptive kernels for fast few-shot learning.
problem Few-shot learning with limited data.
method MetaVRF with latent variable model and variational inference.
result MetaVRF produces kernels with high representational power and fast adaptation.
ARTree uses deep learning to infer tree topologies efficiently.
problem Efficient phylogenetic inference from tree topologies.
method Deep autoregressive model based on graph neural networks (GNNs).
result ARTree provides a flexible family of distributions over tree topologies.
Integrates Fourier features for faster Gaussian process regression.
problem Efficiently scaling Gaussian process regression to large datasets.
method Integrated Fourier features for Gaussian processes.
result Improves Gaussian process regression speed to O(M3) for a broad class of kernels. Estimates and infers multi-stage stationary treatment policies with variable selection.
problem Valid inference for multi-stage stationary treatment policies with high-dimensional feature variables.
method Estimate the value function using augmented inverse probability weighted estimator, apply penalty for variable selection, construct one-step improvements for valid inference.
result Improved estimators are asymptotically normal, valid inference for policy parameters demonstrated.
BIF assesses feature importance using Dirichlet distribution and Bayesian inference.
problem Quantitative feature importance assessment in statistical models.
method Utilizes Dirichlet distribution for probabilistic feature importance assessment via approximate Bayesian inference.
result Learned importance provides relative significance and confidence quantification of features.
The paper finds features correlated with each other for better data inference.
problem Finding relevant features for statistical inference between two data views.
method Deep canonical correlation analysis (DCCA) to find correlated features, constructing non-parametric joint probability distribution.
result The method provides better inference and regularization in supervised learning.
Proposes a framework to assess feature importance without algorithm constraints.
problem Lack of a general framework for assessing feature importance across different algorithms.
method Develops a nonparametric framework for algorithm-agnostic variable importance assessment.
result Valid confidence intervals and testing strategies for variable importance.
Spectral Inference Networks learn eigenfunctions from data using optimization.
problem Learning eigenfunctions of linear operators from data.
method Spectral Inference Networks generalize Slow Feature Analysis to generic symmetric operators and use stochastic optimization.
result Spectral Inference Networks accurately recover eigenfunctions and discover interpretable representations from video data.
Hierarchical model learns progressively abstract representations.
problem Learning meaningful hierarchical latent structures.
method Adversarial training for generative and inference models.
result Minimizing Jensen-Shanon divergence minimizes reconstruction error.