Method selects significant spatial covariates in noisy data.
problem Identifying true spatial covariates in noisy data.
method Combines sparsity-promoting estimation with noise-robust model selection.
result Method reliably recovers true covariates under diverse noise scenarios.
Greedy selection works well in a toy model of independent increments.
problem Iterative selection of maximum-value processes from i.i.d. stochastic processes.
method Fixed greedy selection at each stage.
result Optimal strategy is greedy selection under independent increments.
The study evaluates different parameter selection methods for Gaussian process interpolation.
problem Choosing optimal parameters for Gaussian process interpolation.
method Empirical study using scoring rules and leave-one-out selection criteria.
result The choice of model family is often more important than the selection criterion.
A new knot selection method speeds up sparse Gaussian process approximations.
problem Efficiently selecting knots for sparse Gaussian processes.
method One-at-a-time Bayesian optimization for knot selection.
result Competitive performance with reduced computational cost.
We develop methods to estimate lag and parameters for multiple stable autoregressive processes.
problem Estimating lag and parameters for multiple stable autoregressive processes with unknown lag.
method Use convex programming to simultaneously select lag and estimate parameters across multiple processes.
result The estimated process is stable, and forecasting errors can outperform known rates.
Proposes a more efficient knot selection method for sparse Gaussian processes.
problem Optimizing marginal likelihood for knot selection leads to suboptimal and inefficient placement of knots.
method Uses Bayesian optimization to propose knots one at a time, avoiding multimodal surface issues.
result Improves both accuracy and speed of knot selection compared to current methods.
New metrics using Laplace approximation improve Gaussian process model selection.
problem Finding a balance between model accuracy, interpretability, and simplicity.
method Introducing multiple metrics based on the Laplace approximation to evaluate Gaussian process models.
result Our metrics provide comparable performance to dynamic nested sampling but are significantly faster.
This work improves Gaussian process model selection for large datasets.
problem Prohibitively high computational cost in Gaussian process model selection.
method Linear-time scaling and computational uncertainty tradeoff.
result Computation-aware Gaussian processes can be trained on large datasets efficiently.
We characterize the sample size required for accurate graphical model selection from non-stationary samples. The observed data is modeled as a vector-valued zero-mean Gaussian random process whose samples are uncorrelated but have different covariance matrices. This model contains as special cases the standard setting …
We formulate and analyze a graphical model selection method for inferring the conditional independence graph of a high-dimensional nonstationary Gaussian random process (time series) from a finite-length observation. The observed process samples are assumed uncorrelated over time and having a time-varying marginal dist…
Variable selection for Gaussian process models is often done using automatic relevance determination, which uses the inverse length-scale parameter of each input variable as a proxy for variable relevance. This implicitly determined relevance has several drawbacks that prevent the selection of optimal input variables i…
Gaussian processes are powerful, yet analytically tractable models for supervised learning. A Gaussian process is characterized by a mean function and a covariance function (kernel), which are determined by a model selection criterion. The functions to be compared do not just differ in their parametrization but in thei…
Transfer learning significantly accelerates the reinforcement learning process by exploiting relevant knowledge from previous experiences. The problem of optimally selecting source policies during the learning process is of great importance yet challenging. There has been little theoretical analysis of this problem. In…
This paper tackles federated learning for automatic latent variable selection in multi-output Gaussian processes.
problem Challenges in determining the adequate number of latent processes and relying on centralized learning for privacy and computational issues.
method Proposes a hierarchical model with spike-and-slab priors for automatic latent process selection and variational inference-based federated learning algorithm.
result Demonstrates the advantageous features of the proposed federated approach through simulations and real-world data.
MIC improves VAR order selection accuracy.
problem Order selection in VAR models for accurate forecasting.
method MIC based on expected squared error loss.
result MIC consistently estimates true VAR order.
Kernel methods on discrete domains have shown great promise for many challenging data types, for instance, biological sequence data and molecular structure data. Scalable kernel methods like Support Vector Machines may offer good predictive performances but do not intrinsically provide uncertainty estimates. In contras…
The paper introduces a new model to correct bias in treatment effect estimates due to sample selection.
problem Bias in treatment effect estimates due to sample selection.
method Type 2 Tobit Bayesian Additive Regression Trees (TOBART-2) with Dirichlet Process Mixture distribution and soft trees.
result Corrects bias in treatment effect estimates by accounting for nonlinearities and model uncertainty.
Pattern analysis often requires a pre-processing stage for extracting or selecting features in order to help the classification, prediction, or clustering stage discriminate or represent the data in a better way. The reason for this requirement is that the raw data are complex and difficult to process without extractin…
New method for efficient personalized learning in mobile health.
problem Efficient and personalized learning in mobile health.
method Proposes a novel generative process on kernel composition for online Gaussian Process regression.
result Trajectories of kernel evolutions can be transferred between users to improve learning and kernels are meaningful for mHealth prediction.
Develops methods to select informative conformal prediction sets with FCR control.
problem Selecting informative prediction sets with FCR control in supervised learning.
method Unified framework for informative conformal prediction sets with FCR control.
result First procedures providing FCR control for informative prediction sets.
We identify and analyze selection structure in sequential data.
problem Selection biases in sequential data can distort analysis and hide underlying generation processes.
method Nonparametric identifiability of selection structure without interventional experiments.
result Selection structure is identifiable in sequential data without parametric assumptions.
We test three common information criteria (IC) for selecting the order of a Hawkes process with an intensity kernel that can be expressed as a mixture of exponential terms. These processes find application in high-frequency financial data modelling. The information criteria are Akaike's information criterion (AIC), the…
Active learning selects both observations and annotation precision for Gaussian Processes.
problem Costly annotation in supervised learning.
method Proposes an active learning algorithm that selects observations and annotation precision, using a modified BALD objective.
result Empirically shows the benefits of adjusting annotation precision in active learning.
Biomedical data are widely accepted in developing prediction models for identifying a specific tumor, drug discovery and classification of human cancers. However, previous studies usually focused on different classifiers, and overlook the class imbalance problem in real-world biomedical datasets. There are a lack of st…
New method improves prediction accuracy in business process mining by handling concept drift.
problem Improving prediction quality in business process mining affected by concept drift.
method Systematically analyzed and compared different data selection strategies for retraining machine learning models.
result Improved accuracy from 0.5400 to 0.7010 with concept drift handling.
Simplified feature selection using a single agent with restructured choice strategy.
problem Efficiency and cost issues in multi-agent reinforced feature selection.
method Single-agent approach with restructured choice strategy, including scanning method, feature prioritization, state representation, and reward scheme.
result Improved efficiency and effectiveness of feature selection.
Efficiently processes high res images by selecting relevant patches.
problem High memory and compute requirements for processing large images.
method Differentiable Top-K operator to select relevant patches.
result End-to-end trainable model using backpropagation.
A RL framework selects features to balance bias and accuracy dynamically.
problem Bias in automated feature selection when predictors are correlated.
method Multi-component reward function with policy gradient for dynamic regularization and bias mitigation.
result Model balances fairness and accuracy during training.
While variable selection is essential to optimize the learning complexity by prioritizing features, automating the selection process is preferred since it requires laborious efforts with intensive analysis otherwise. However, it is not an easy task to enable the automation due to several reasons. First, selection techn…
In the context of variable selection, ensemble learning has gained increasing interest due to its great potential to improve selection accuracy and to reduce false discovery rate. A novel ordering-based selective ensemble learning strategy is designed in this paper to obtain smaller but more accurate ensembles. In part…
Heavy-tailed distributions are frequently used to enhance the robustness of regression and classification methods to outliers in output space. Often, however, we are confronted with "outliers" in input space, which are isolated observations in sparsely populated regions. We show that heavy-tailed stochastic processes (…
SEEK algorithm selects minimal state in reinforcement learning for better policy learning.
problem Challenges in obtaining a state representation that is parsimonious and satisfies the Markov property.
method SEEK algorithm estimates the minimal sufficient state in reinforcement learning.
result The SEEK algorithm achieves selection consistency in large samples.
A single pre-trained agent guides feature selection using knockoffs.
problem Feature selection challenges in AI-readiness of data.
method Generates knockoff features and uses reinforcement learning.
result Optimal feature subset identified with reduced dependency on target variable.
Novel Bayesian model improves EEG-based BCI character selection.
problem Accurately identifying target-related responses in EEG-based BCIs.
method Probit-link Split-and-merge Gaussian Process (P-SMGP) prior for feature selection.
result Reduces computational complexity and provides interpretable statistical interpretations.
Batch Active Learning uses derivative information for Gaussian Process regression.
problem Efficiently selecting data batches in Gaussian Process regression models.
method Proposes using the predictive covariance matrix to select data batches, exploiting full correlation.
result Demonstrates the effectiveness of incorporating derivative information across diverse applications.
This paper reviews feature selection in KGs for improved ML model performance.
problem Improving feature selection in KGs for better machine learning model efficacy.
method Comprehensive review of feature selection methodologies in KGs.
result Advancement in scalability, accuracy, and interpretability of feature selection techniques.
Online method selects candidates from data streams, ensuring irreversible decisions.
problem Conformal selection's incompatibility with irreversible decisions in online scenarios.
method Online Conformal Selection with Accept-to-Reject Changes (OCS-ARC) incorporating online Benjamini-Hochberg procedure.
result OCS-ARC controls FDR at or below nominal level, improving selection power.
Boundary effects inflate variance in Gaussian processes, leading to acquisition bias.
problem Boundary-induced acquisition bias in Gaussian processes.
method Traced root cause to geometric mechanism of kernel truncation at domain boundaries.
result Boundary effects create distortion that worsens with dimensionality, affecting acquisition behavior.
A method to select important experts for Gaussian processes to balance computational efficiency and uncertainty quantification.
problem Balancing computational efficiency and uncertainty quantification in Gaussian processes for big data.
method Using graphical models to select important experts and aggregate their predictions while ensuring uncertainty quantification.
result Substantially reduces computational cost of aggregating dependent experts while ensuring calibrated uncertainty quantification.
New model considers wealth and time affecting risk aversion in portfolio selection.
problem Optimal investment strategy and consumption process depend on wealth and future income balance.
method Proposed a new mean-variance-utility framework with time and state-dependent risk aversion, solved using game theory.
result Equilibrium investment and consumption policies derived, aligning with investor behavior.
Binary Stochastic Filtering (BSF), the algorithm for feature selection and neuron pruning is proposed in this work. The method defines filtering layer which penalizes amount of the information involved in the training process. This information could be the input data or output of the previous layer, which directly lead…
Two algorithms improve GP bandits by selecting priors and minimizing regret.
problem Selecting appropriate GP priors for unknown functions.
method Developed two algorithms: Prior-Elimination GP-TS and HyperPrior GP-TS.
result Established sublinear regret bound for HyperPrior GP-TS.
Efficiently searches through Gaussian process kernels using symbolic representation and Bayesian optimization.
problem Manual selection of kernels in Gaussian processes is complex and computationally expensive.
method Proposes a novel method using symbolic representation and Bayesian optimization to search through a structured kernel space.
result Empirically shows a computationally more efficient way of searching through a discrete kernel space.
Bayesian On-line Changepoint Detection is extended to on-line model selection and non-stationary spatio-temporal processes. We propose spatially structured Vector Autoregressions (VARs) for modelling the process between changepoints (CPs) and give an upper bound on the approximation error of such models. The resulting …
Proposes a method to increase diversity without sacrificing meritocracy.
problem Systemic bias in datasets affecting diversity and meritocracy.
method Optimally flipping outcome labels and training classification models simultaneously.
result The price of diversity is low and sometimes negative, enhancing diversity without significantly affecting meritocracy.
Feature selection predicts immune state changes in RA mouse model.
problem Predicting the immune state change after RA immunotherapy.
method Feature selection algorithms applied to mouse CIA model data.
result Selected features predict both T cell markers and treatment efficacy.
Study evaluates model selection methods for time series forecasting.
problem Evaluating which model is best for time series forecasting.
method Compared various estimation methods for selecting the best model.
result Accuracy of model selection estimators is low, and performance loss is significant.
A simple and widely adopted approach to extend Gaussian processes (GPs) to multiple outputs is to model each output as a linear combination of a collection of shared, unobserved latent GPs. An issue with this approach is choosing the number of latent processes and their kernels. These choices are typically done manuall…