The literature on statistical learning for time series assumes the asymptotic independence or ``mixing' of the data-generating process. These mixing assumptions are never tested, nor are there methods for estimating mixing rates from data. We give an estimator for the β-mixing rate based on a single stationary sample…
Library learns Bayesian networks from mixed data without discretization.
problem Learning Bayesian networks from mixed data (discrete and continuous variables).
method Proposes an algorithm for structural and parameter learning of Bayesian networks from mixed data using a mixed MI score function and Gaussian approximation. Offers two graph structure enumeration algorithms.
result Advantages in solving approximation and gap recovery problems on synthetic and real datasets.
FAMDAD detects anomalies in mixed data using kurtosis-weighted Factor Analysis.
problem Detecting anomalies in high-dimensional mixed data.
method kurtosis-weighted Factor Analysis of Mixed Data (FAMDAD).
result Anomalies are highly separable in the first and last few dimensions of the FAMDAD embedding.
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.
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.
New model clusters mixed-type data with missing values, improving air quality analysis.
problem Clustering mixed-type data with missing values and regime persistence.
method Statistical jump model incorporating regime persistence and handling missing data.
result Superior performance in inferring persistent air quality regimes compared to traditional methods.
New clustering algorithm for mixed data improves applicability and efficiency.
problem Clustering large, mixed data with improved accuracy and efficiency.
method Developed a new clustering algorithm using peak-finding technique, reducing computational complexity.
result Algorithm detects outliers, clusters of lower density, and determines correct number of clusters.
Extends co-clustering to mixed numerical and binary data.
problem Co-clustering of mixed data types (numerical and binary).
method Latent block models for mixed data types.
result Effectiveness of the proposed approach on simulated data.
New method for conformal prediction under Markovian data reduces coverage gap.
problem Reducing coverage gap in conformal prediction for Markovian data.
method Split Conformal Prediction method adapted to Markovian data, with K-split CP for improved performance.
result Coverage gap typically scales as √(t_mix * ln(n) / n) for general Markov chains, and can be reduced to t_mix / (n * ln(n)) with K-split CP.
Bayesian test assesses dependence between mixed data types.
problem Assessing dependence between text, image, and sound data.
method Bayesian kernelised correlation test using Dirichlet process model.
result Demonstrated effectiveness compared to other methods.
A novel graph spectral method for mixed categorical and numerical data.
problem Feature learning for mixed data types (numerical and categorical).
method Graph spectral decomposition of the graph Laplacian to model probabilistic dependence structure.
result Increased separability and clusterability of observations in the transformed feature space.
Develops new algorithms for QRF to handle mixed-frequency and longitudinal data.
problem Handling mixed-frequency and longitudinal data in quantile regression.
method Mixed-Frequency Quantile Regression Forest (MIDAS-QRF) and Finite Mixture Quantile Regression Forest (FM-QRF).
result Valid and flexible models for complex empirical settings in financial risk management and climate-change impact evaluation.
MMM model clusters mixed-type longitudinal data efficiently.
problem Challenges in clustering multivariate longitudinal mixed-type data.
method MMM model reorganizes data into a three-way structure, using a mixture of matrix-variate normal distributions.
result MMM model handles various data types (continuous, ordinal, binary, nominal, count) and temporal dependence.
The paper proposes methods for predicting missing values in mixed data matrices.
problem Matrix completion for mixed data types (continuous, binary, ordinal).
method Generalized latent factor models for low-rank matrix estimation with entrywise consistency.
result Tight probabilistic error bounds for the proposed estimators.
Superpixel-mix enhances reliability in semantic segmentation.
problem Improving reliability in real-world semantic segmentation.
method Superpixel-mix, a new data augmentation method with teacher-student consistency training.
result Superpixel-mix achieves state-of-the-art results in semi-supervised semantic segmentation.
Mixed data comprises both numeric and categorical features, and mixed datasets occur frequently in many domains, such as health, finance, and marketing. Clustering is often applied to mixed datasets to find structures and to group similar objects for further analysis. However, clustering mixed data is challenging becau…
New method adapts to unknown mixing time in stochastic optimization.
problem Optimizing with Markovian data where mixing time is unknown.
method Combines MLMC gradient estimation with adaptive learning.
result Achieves optimal convergence rate for convex problems.
GBMixed boosts mixed models for clustered data, estimating mean and variance flexibly.
problem Flexible estimation of mean and variance components in clustered data.
method Gradient Boosting framework for linear mixed models with likelihood-based gradients.
result GBMixed accurately recovers complex nonlinear fixed effects and covariances.
Method improves regression models using unlabeled data.
problem Improving predictive performance of regression models with limited labeled data.
method Mixed semi-supervised generalized-linear-regression with different mixing mechanisms.
result Integrating unlabeled data consistently improves predictive performance.
Develops a deep learning framework for various data types.
problem Handling nonparametric regression and classification across different data types.
method Introduces a general framework with two estimators: NPDNN and SPDNN, based on data satisfying generalized Bernstein-type inequalities.
result Both NPDNN and SPDNN estimators are minimax optimal in many classical settings.
Proposes CDTD, a diffusion model for mixed-type tabular data.
problem Adapting diffusion models to mixed-type tabular data.
method Score matching and score interpolation for continuous features, adaptive noise schedules for categorical features.
result Consistently outperforms state-of-the-art models in mixed-type tabular data.
The analysis of mixed data has been raising challenges in statistics and machine learning. One of two most prominent challenges is to develop new statistical techniques and methodologies to effectively handle mixed data by making the data less heterogeneous with minimum loss of information. The other challenge is that …
i-Mix improves contrastive learning across domains without domain-specific augmentations.
problem Improving contrastive representation learning for unlabeled data across diverse domains.
method i-Mix treats contrastive learning as a non-parametric classifier problem, mixing data in input and virtual label spaces.
result i-Mix consistently improves representation quality across image, speech, and tabular data domains.
Mixed membership factorization is a popular approach for analyzing data sets that have within-sample heterogeneity. In recent years, several algorithms have been developed for mixed membership matrix factorization, but they only guarantee estimates from a local optimum. Here, we derive a global optimization (GOP) algor…
The study examines mixing times of data-augmentation Gibbs samplers for high-dimensional probit regression.
problem Investigating convergence properties of data-augmentation samplers for Bayesian probit regression.
method Using recent results on Gibbs samplers for log-concave targets, the study provides non-asymptotic bounds on mixing times.
result Explicit non-asymptotic bounds on mixing times depend on design matrix and prior precision, holding uniformly over responses.
Lower bound on BART's mixing time increases with data points.
problem Slow mixing time in BART's MCMC chains.
method Simplified BART with a single tree and reduced MCMC moves.
result Mixing time grows exponentially with data points.
Study compares neural and statistical models for Parkinson's disease progression from voice data.
problem Difficult statistical analysis of longitudinal voice biomarkers due to subject correlation, small cohorts, and varied disease trajectories.
method Evaluated Neural Mixed Effects (NME), Generalized Neural Network Mixed Models (GNMMs), and semi-parametric Generalized Additive Mixed Models (GAMMs).
result GAMMs achieve stronger predictive performance and retain interpretable smooth effects and subject-level structure.
New method for robust matrix completion with mixed data types.
problem Recovering a structured low rank matrix with mixed data types.
method Proposes a computationally feasible statistical approach with strong recovery guarantees for mixed data types.
result Strong recovery guarantees for low rank matrix completion with mixed data types.
metabeta uses neural networks to speed up Bayesian mixed-effects regression.
problem Bayesian mixed-effects regression is computationally expensive.
method metabeta is a neural network model that pre-trains to estimate posterior distributions.
result metabeta achieves comparable performance to MCMC at a fraction of the time.
New method detects essential tori in mixed singularity links.
problem Detecting essential tori in mixed singularity link complements.
method Analyzing properties of defining mixed polynomials.
result Explicit criteria for essential tori existence.
Improves decentralized learning by optimizing graph mixing for data heterogeneity.
problem Data heterogeneity impacts convergence in decentralized learning, but existing methods ignore this.
method Characterized and quantified the relationship between graph mixing and data heterogeneity. Proposed an optimization approach to improve convergence.
result Our approach leads to improved test performance across various tasks.
Gradient Boosted Mixed Models estimate mean and variance components for clustered data.
problem Limited flexibility in linear mixed models for complex settings.
method Gradient Boosting extended to mixed models with likelihood-based gradients and flexible base learners.
result Accurate recovery of variance components and improved predictive accuracy.
Bayesian machine learning methods improve nowcasting with mixed frequency data.
problem Handling frequency mismatches and predicting short-term economic indicators.
method Developed Gaussian process (GP) methods for MIDAS regressions.
result Gaussian process-MIDAS methods offer gains in predictive accuracy.
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 online imputation method for mixed data improves accuracy and speed.
problem Missing value imputation in online settings for mixed data types.
method Online Gaussian copula model for imputation and change point detection.
result The model improves accuracy and speed, especially on large datasets.
L21 SNF compresses mixed-sign data robustly.
problem Compression of mixed-sign data with high fidelity.
method Regularized L21 Semi-NonNegative Matrix Factorization (L21 SNF).
result Rigorous proof of convergence and use-case advantages demonstrated.
Mix-IRLS solves imbalanced mixed linear regression problems efficiently.
problem Imbalanced mixed linear regression problems.
method Sequential robust regression approach.
result Mix-IRLS outperforms other methods on imbalanced mixtures and real-world datasets.
A new method clusters mixed-type data efficiently.
problem Clustering mixed-type data with continuous and categorical variables.
method Extends Information Bottleneck principle to heterogeneous data using generalised product kernels.
result DIBmix outperforms four established methods in various scenarios.
In this paper, we propose a novel learning method for image classification called Between-Class learning (BC learning). We generate between-class images by mixing two images belonging to different classes with a random ratio. We then input the mixed image to the model and train the model to output the mixing ratio. BC …
"Mixed Data" comprising a large number of heterogeneous variables (e.g. count, binary, continuous, skewed continuous, among other data types) are prevalent in varied areas such as genomics and proteomics, imaging genetics, national security, social networking, and Internet advertising. There have been limited efforts a…
Outlier detection amounts to finding data points that differ significantly from the norm. Classic outlier detection methods are largely designed for single data type such as continuous or discrete. However, real world data is increasingly heterogeneous, where a data point can have both discrete and continuous attribute…
Study online learning in RKHS with dependent processes, focusing on \(β\)- and \(φ\)-mixing.
problem Online learning in RKHS with dependent data.
method Online regularized learning algorithm in RKHS, analyzing \(β\)- and \(φ\)-mixing sequences.
result Probabilistic upper bounds and convergence rates for mixing coefficients.
FairMixRep learns fair representations from mixed data types.
problem Representation learning in mixed numerical and categorical data with fairness constraints.
method Efficient encoder-decoder framework + fairness constraints.
result Excellent performance in preserving information and fairness in mixed data representations.
A new SSL method improves medical image classification using global latent mixing.
problem Costly annotation of large-scale medical image data sets.
method Linear mixing of labeled and unlabeled data in both input and latent space.
result Improved performance in semi-supervised classification of thoracic disease and skin lesion.
Aioli unifies language model data mixing methods and improves performance.
problem Optimizing the mixture of training data groups for language models.
method Unified optimization framework for dynamically adjusting mixture proportions.
result Aioli outperforms existing methods by up to 12.012 test perplexity points.
This paper compares methods for handling mixed-attribute data in GFMM neural networks.
problem Handling datasets with mixed features in GFMM neural networks.
method Three main methods: encoding, combining with other classifiers, and specific learning algorithms.
result Encoding methods and combining with decision trees improve GFMM models' performance.
New method for mixed data FI controls type I error and achieves high power.
problem Statistical inadequacy of feature importance measures for mixed data.
method Combining CPI framework with sequential knockoffs for mixed data.
result Our method controls type I error and achieves high power for mixed data.
DPERC efficiently estimates covariance matrices for mixed data with missing values.
problem Estimating covariance matrices for datasets with missing values and mixed features.
method Direct Parameter Estimation for Randomly Missing Data with Categorical Features (DPERC).
result DPERC outperforms other methods in estimating covariance matrices for mixed data with missing values.