A new data augmentation method selects mixed classes based on class distances for better performance.
problem Improving recognition accuracy in object recognition using deep learning.
method Calculates class distances and selects mixed data from suitable classes dynamically.
result Improves recognition performance on general and long-tailed image recognition datasets.
This paper is concerned with an important issue in finite mixture modelling, the selection of the number of mixing components. We propose a new penalized likelihood method for model selection of finite multivariate Gaussian mixture models. The proposed method is shown to be statistically consistent in determining of th…
New method uses dendrograms for better mixture model selection and clustering.
problem Selecting the correct number of components in finite mixture models.
method Hierarchical clustering tree derived from overfitted latent mixing measures.
result Consistently selects the true number of mixing components and optimal convergence rate for parameter estimation.
A hybrid model for Bayesian optimization handles mixed variables using MCTS for categorical and GP for continuous.
problem Optimizing functions with mixed variable types (continuous, integer, categorical).
method Merges MCTS for categorical and GP for continuous variables, integrates UCTS search strategy, and dynamically selects kernels.
result Hybrid models outperform traditional methods in Bayesian optimization.
We study the computational complexity of Markov chain Monte Carlo (MCMC) methods for high-dimensional Bayesian linear regression under sparsity constraints. We first show that a Bayesian approach can achieve variable-selection consistency under relatively mild conditions on the design matrix. We then demonstrate that t…
This paper uses MIO to select features for kernel SVM classification.
problem Feature selection for kernel SVM classification.
method Mixed-integer optimization (MIO) for feature subset selection.
result The MIO approach can often outperform linear-SVM-based methods in prediction performance.
BayesBoost combines boosting and Bayesian methods for linear mixed models, improving uncertainty estimation and variable selection.
problem Lack of straightforward uncertainty estimation for parameters in high-dimensional linear mixed models.
method BayesBoost: Combines boosting and Bayesian inference for linear mixed models.
result Improves uncertainty estimation and variable selection in linear mixed models.
CLIM-FS tackles mixed-missing multi-view unsupervised feature selection.
problem Mixed-missing multi-view data with incomplete features and views.
method Integrates imputation of missing views and variables into feature selection model based on nonnegative orthogonal matrix factorization.
result CLIM-FS outperforms state-of-the-art methods on real-world datasets.
MOMENT selects and estimates mixed-effects models using moment identities.
problem Selecting and estimating random-effects covariance matrix and fixed-effects coefficients in multiresponse linear mixed-effects models.
method MOMENT is a stage-wise moment-based framework that reduces the random-effects selection problem to a smooth constrained convex optimization problem.
result MOMENT performs competitively and can outperform separate univariate analyses for correlated responses.
Joint sparsity offers powerful structural cues for feature selection, especially for variables that are expected to demonstrate a "grouped" behavior. Such behavior is commonly modeled via group-lasso, multitask lasso, and related methods where feature selection is effected via mixed-norms. Several mixed-norm based spar…
Unified Bayesian Optimisation for mixed variables improves performance.
problem Efficient optimisation of problems with both categorical and continuous variables.
method Derive value proposals from the Expected Improvement criterion to optimise both categorical and continuous variables under a single acquisition metric.
result Unified approach significantly outperforms existing methods across mixed-variable tasks.
In neuroimaging data analysis, Gaussian graphical models are often used to model statistical dependencies across spatially remote brain regions known as functional connectivity. Typically, data is collected across a cohort of subjects and the scientific objectives consist of estimating population and subject-specific g…
SelectMix improves deep learning robustness against noisy labels.
problem Deep neural networks memorize noisy labels, degrading performance.
method Confidence-guided targeted sample mixing with soft labels.
result SelectMix consistently outperforms baseline methods on noisy label datasets.
Bayesian method selects subsets for LMMs with structured dependence.
problem Subset selection challenge in LMMs with structured dependence.
method Bayesian decision analysis with Mahalanobis loss function.
result Optimal linear coefficients for subsets and cardinality constraints.
A DP method selects best sparse models in high dimensions efficiently.
problem Model selection in high-dimensional sparse linear regression under privacy constraints.
method Differential privacy (DP) with exponential mechanism and Metropolis-Hastings algorithm.
result The method identifies active features quickly under privacy constraints.
New algorithm improves mixing in Bayesian mixture models.
problem Slow mixing in Bayesian mixture models.
method A new Monte Carlo algorithm for sampling from the marginal posterior of a general integrable mixture.
result The new algorithm achieves excellent mixing times, outperforming standard Gibbs sampling in some cases.
New method selects sparse predictors in large LMMs.
problem Sparse learning for LMMs is computationally infeasible for large datasets.
method Developed an ℓ0 regularized method with coordinate descent and local search algorithms. result Method selects thousands of predictors in seconds to minutes.
iGecco+ integrates multi-view data for better clustering.
problem Discovering common group structure in mixed multi-view data.
method Integrative Generalized Convex Clustering Optimization (iGecco) with adaptive feature selection.
result iGecco+ achieves superior clustering performance on high-dimensional mixed multi-view data.
New RL method MAC improves performance in sparse reward settings.
problem Slow mixing in large state spaces or sparse rewards.
method Multi-level Monte Carlo Actor-Critic (MAC) algorithm.
result Achieves convergence rate comparable to state-of-the-art AC algorithms.
This thesis studies two problems in modern statistics. First, we study selective inference, or inference for hypothesis that are chosen after looking at the data. The motiving application is inference for regression coefficients selected by the lasso. We present the Condition-on-Selection method that allows for valid s…
Multi-task learning (MTL) has achieved success over a wide range of problems, where the goal is to improve the performance of a primary task using a set of relevant auxiliary tasks. However, when the usefulness of the auxiliary tasks w.r.t. the primary task is not known a priori, the success of MTL models depends on th…
This paper concerns a method of selecting a subset of features for a sequential logit model. Tanaka and Nakagawa (2014) proposed a mixed integer quadratic optimization formulation for solving the problem based on a quadratic approximation of the logistic loss function. However, since there is a significant gap between …
Proposes a method to select variables for kernel two-sample tests.
problem Determining whether two samples have the same distribution using informative variables.
method A framework based on kernel maximum mean discrepancy (MMD) for selecting a subset of variables.
result The sample size requirements for the three kernels depend on the number of selected variables, not the data dimension.
Post-training quantization method using multiple low-precision points achieves higher precision for critical weights.
problem Discretizing pre-trained deep neural networks without re-training.
method Multipoint quantization with efficient greedy selection and adaptive point number.
result Outperforms state-of-the-art methods on ImageNet classification and PASCAL VOC object detection.
Develops SCMs for latent selection to simplify causal analysis.
problem Latent selection complicates causal analysis.
method Introduces a conditioning operation for SCMs to encode latent selection.
result Conditioning operation preserves simplicity, acyclicity, and linearity of SCMs.
Linear Mixed Models (LMMs) are important tools in statistical genetics. When used for feature selection, they allow to find a sparse set of genetic traits that best predict a continuous phenotype of interest, while simultaneously correcting for various confounding factors such as age, ethnicity and population structure…
Data integration methods that analyze multiple sources of data simultaneously can often provide more holistic insights than can separate inquiries of each data source. Motivated by the advantages of data integration in the era of "big data", we investigate feature selection for high-dimensional multi-view data with mix…
New method optimizes mixed integer optimization for hierarchical modeling of clustered and longitudinal data.
problem Optimizing subset selection in hierarchical models with clustered and longitudinal data.
method Distribution-free mixed-integer optimization approach for cluster-aware regression.
result The method efficiently solves problems within minutes and outperforms traditional models in generating sparse solutions with high predictive power.
Paper introduces DP methods for high-dimensional variable selection.
problem Sparse variable selection in high-dimensional learning.
method Pure differentially private estimators using Integer Programming.
result Achieves state-of-the-art empirical support recovery.
Automates model selection for GLMs using optimization.
problem Automating model selection for generalized linear models.
method Mixed-integer conic optimization for feature subset selection and model constraints.
result Optimization of AIC and BIC criteria with multicollinearity constraints.
Unified framework for SGMoE resolves estimation and selection issues.
problem Non-identifiability, coupled differential relations, and tight coupling in softmax-Gated models.
method Unified statistical framework with Voronoi-type loss functions and dendrograms of mixing measures.
result Consistent selection of the number of experts without model sweeps, optimal parameter rates under overfitting.
Two algorithms learn Gaussian graphical models from Glauber dynamics trajectories, achieving optimal performance.
problem Learning Gaussian graphical models from a single trajectory of a dependent stochastic process.
method Two algorithms based on dueling-neighborhood search and local statistics built from the update sequence of Glauber dynamics.
result Achieve κ−2 dependence of the information-theoretic lower bounds, mixing-free and signal-optimal. A new clustering model for mixed datasets combines continuous and non-continuous data.
problem Challenges in clustering mixed data due to heterogeneous variables.
method Mixed Deep Gaussian Mixture Model (MDGMM) with multilayer architecture.
result Automatic selection of model specifications and optimal number of clusters.
New model uses Half-Full/Half-Empty approach for better portfolio selection.
problem Improving portfolio selection through behavioral finance.
method Generalized Half-Full/Half-Empty approach to positive/negative lotteries, developing nonconvex optimization and mixed-integer linear programming models.
result The Half-Full/Half-Empty model outperforms other methods in risk and profitability.
MOCA-HESP optimizes high-dimensional combinatorial and mixed spaces using hyper-ellipsoid partitioning.
problem Challenges in optimizing high-dimensional, combinatorial and mixed spaces.
method MOCA-HESP uses hyper-ellipsoid space partitioning with different categorical encoders and multi-armed bandit for adaptive selection.
result MOCA-HESP outperforms existing methods on various synthetic and real-world benchmarks.
Unified multitask learning framework for mixed-type outcomes.
problem Difficulty in formulating a unified objective for tasks with different outcomes.
method Multitask transformation framework with shared sparsity, using deep neural networks and rank-based optimization.
result Improved prediction and variable selection across continuous, binary, and mixed outcomes.
FBMS R package simplifies Bayesian model selection and averaging.
problem Complex regression settings with multi-modal posterior landscapes.
method Efficient MJMCMC and GMJMCMC algorithms for Bayesian model exploration.
result FBMS effectively handles Bayesian generalized linear and nonlinear models.
Proposes a boosting framework for sparsity in grouped covariates.
problem Sparsity and selection bias in grouped covariates.
method Component-wise and group-wise gradient boosting with adjusted degrees of freedom.
result Reduces bias and improves predictability in variable selection.
Study counterfactuals in combinatorial choice using a representative agent model.
problem Analyzing decision-making from aggregated binary polytope data.
method Nonparametric approach based on a representative agent model, solving polynomial and mixed-integer convex programs.
result Developed a method for counterfactual prediction that works even under model misspecification.
Paper analyzes agnostic learning of mixed linear regression without generative models.
problem Learning mixed linear regression without assuming stochastic generation.
method Expectation Maximization (EM) and Alternating Minimization (AM) algorithms.
result AM and EM algorithms converge to population loss minimizers under standard conditions.
Selective imputation improves treatment effect estimation from missing data.
problem Missing data complicates treatment effect estimation, especially with treatment variables.
method Introduced mixed confounded missingness (MCM) and selective imputation.
result Selective imputation provides unbiased treatment effect estimates.
Best-of-∞ improves LLM performance by efficiently allocating inference-time computation.
problem Achieving optimal performance in test-time LLM ensembling with infinite budget.
method Adaptive generation scheme and weighted ensembles of LLMs, formulated as mixed-integer linear program.
result Optimal ensemble weighting improves performance over individual models.
We propose a unified framework to address a family of classical mixed-integer optimization problems with logically constrained decision variables, including network design, facility location, unit commitment, sparse portfolio selection, binary quadratic optimization, sparse principal analysis and sparse learning proble…
Batchboost stabilizes training by mixing and pairing samples, improving accuracy.
problem Stabilizing training in machine learning, especially avoiding overfitting and underfitting.
method Batchboost pipeline with three stages: pairing, mixing, and feeding. Mixing uses mixup technique.
result Batchboost achieves 0.5-3% better accuracy than mixup on CIFAR-10 & Fashion-MNIST.
Propose an XMSE-aware mixed estimator for EB that interpolates between ML and EB shrinkage.
problem Kernel-based EB estimation may be worse than ML when the kernel is poorly aligned with the true parameter.
method An XMSE-aware mixed estimator that interpolates between ML and EB shrinkage.
result Fixed-weight XMSE is a scalar quadratic, yielding a closed-form oracle mixing weight that is no worse than both ML and the base EB estimator at the XMSE scale.
Paper tackles offline RL from mixed datasets with adaptive KL regularizer.
problem Challenges in optimizing RL and BC signals with varying action coverage and multiple action modes.
method Adaptively weighted reverse KL divergence regularizer based on TD3 algorithm.
result Empirically outperforms existing offline RL algorithms in MuJoCo locomotion tasks.
Clustering is an essential technique for discovering patterns in data. The steady increase in amount and complexity of data over the years led to improvements and development of new clustering algorithms. However, algorithms that can cluster data with mixed variable types (continuous and categorical) remain limited, de…
New adaptive temperature selection improves parallel tempering efficiency.
problem Enhancing mixing in multi-modal distributions using parallel tempering.
method Adaptive temperature selection using policy gradient approach.
result Lower integrated autocorrelation times achieved compared to traditional methods.