The paper explores the relationship between joint mixability and negative dependence structures.
problem Understanding the connection between joint mixability and various negative dependence concepts.
method Analyzes the properties of joint mixes and their relation to negative dependence structures.
result Derives necessary and sufficient conditions for a joint mix to be negatively dependent.
In this short paper, in order to price occupation-time options, such as (double-barrier) step options and quantile options, we derive various joint distributions of a mixed-exponential jump-diffusion process and its occupation times of intervals.
QR-MIX models joint state-action values as a distribution to handle randomness in MARL.
problem Randomness in rewards and observations leads to randomness in long-term returns in MARL.
method QR-MIX uses quantile regression and combines it with QMIX and IQN to model joint state-action values as a distribution.
result QR-MIX outperforms QMIX in the StarCraft Multi-Agent Challenge (SMAC) environment.
RFCDE uses random forests for estimating complex conditional densities.
problem Estimating nonparametric conditional densities for mixed-type data.
method Random Forests optimized for nonparametric conditional density estimation.
result RFCDE enables analysis of conditional probability distributions and joint distributions.
Paper presents a method to estimate mixed-variable distributions.
problem Estimating joint, conditional, and marginal distributions from mixed data.
method Graph representation of data, eigenvector equations for distribution estimation.
result Method successfully estimates distributions for various machine learning tasks.
Study on pairwise counter-monotonicity, a type of negative dependence.
problem Understanding and quantifying extremal negative dependence structures.
method Established stochastic representation and invariance property; showed implications and connections.
result Pairwise counter-monotonicity implies negative association and joint mix dependence.
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.
This paper addresses the problem of identifying a lower dimensional space where observed data can be sparsely represented. This under-complete dictionary learning task can be formulated as a blind separation problem of sparse sources linearly mixed with an unknown orthogonal mixing matrix. This issue is formulated in a…
CoDeQ simplifies joint model compression by integrating pruning and quantization.
problem Joint pruning and quantization methods are complex and require additional procedures.
method CoDeQ uses a dead-zone quantizer to directly induce sparsity and learn quantization parameters.
result CoDeQ achieves high sparsity and low-precision accuracy with minimal bit operations.
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…
New method simplifies Bayesian inference for multi-Dirichlet priors.
problem Inference for models with hierarchical Multi-Dirichlet priors is tricky.
method Auxiliary variable scheme simplifies joint distribution of model parameters.
result Efficient inference schemes derived using the auxiliary variable scheme.
We link disjoint longitudinal data for rare disease patients using latent representations and mixed-effects regression.
problem Analyzing treatment switches in rare diseases with limited data and changing measurement instruments.
method We embed item values into a shared latent space using variational autoencoders and apply mixed-effects regression to quantify treatment effects.
result Our approach allows for statistical inference and quantifies the impact of treatment switches in spinal muscular atrophy.
New resonance theory for Anosov flows connects spectral properties to mixing measures.
problem Defining and analyzing Ruelle-Taylor resonances for Anosov actions.
method Combining microlocal methods and J. Taylor's cohomological theory, defining Ruelle-Taylor resonances and proving Fredholm theory.
result Ruelle-Taylor resonances form a discrete subset of Cκ with λ=0 being a leading resonance. New algorithm identifies dominant arm with high probability.
problem Identifying the arm with the highest realized reward in multi-armed bandits.
method Dominance score criterion and joint mixing and recycling mechanism.
result Identifies the best dominant arm with nearly optimal sample complexity.
Proposes a method to capture similarities and covariances between related tasks in multivariate regression.
problem Predicting multiple response variables with shared explanatory variables and capturing within-group similarities.
method Uses multivariate linear mixed models to estimate coefficients and errors, modeling within-group similarities through joint estimation of covariance matrices.
result The proposed MrRCE method outperforms natural competitors and alternative estimators in various model settings.
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.
Develops a new method for learning discrete distributions without embedding them in a continuous space.
problem Challenges in learning discrete distributions using current methodologies.
method Introduces a MAD invertible map and a mixed variational flow (MAD Mix) for discrete distributions.
result MAD Mix produces more reliable approximations than continuous-embedding flows.
Probabilistic inference in graphical models is the task of computing marginal and conditional densities of interest from a factorized representation of a joint probability distribution. Inference algorithms such as variable elimination and belief propagation take advantage of constraints embedded in this factorization …
RVAE detects and repairs corrupted cells in mixed-type tabular data.
problem Outlier detection and repair in mixed-type tabular data.
method Robust Variational Autoencoder (RVAE) learns the joint distribution of clean data and identifies outlier cells.
result RVAE outperforms state-of-the-art methods in cell outlier detection and repair for tabular data.
QMIX combines per-agent values to create decentralised policies.
problem Training decentralised policies from centralised learning.
method QMIX uses a mixing network to estimate joint action-values as a monotonic combination of per-agent values.
result QMIX significantly outperforms existing methods on the StarCraft Multi-Agent Challenge (SMAC).
A new method predicts causal relationships without joint data.
problem Falsifying causal discovery algorithms without ground truth.
method Leave-One-Variable-Out (LOVO) prediction for causal graphs.
result LOVO method correlates prediction error with causal algorithm accuracy.
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.
Mixed DNN approach improves EEG-based speech imagery recognition.
problem Automatic identification of imagined speech from EEG.
method Hierarchical deep neural network strategy combining CNN, RNN, and autoencoders.
result 23.45% improvement in accuracy over baseline method.
Develops large-sample theory for non-stationary source separation.
problem Lack of large-sample results for non-stationary source separation methods.
method Large-sample theory for NSS-JD method under specific assumptions.
result Consistency of unmixing estimator and its convergence to Gaussian distribution.
This paper stidies the first passage times to constant boundaries for mixed-exponential jump diffusion processes. Explicit solutions of the Laplace transforms of the distribution of the first passage times, the joint distribution of the first passage times and undershoot (overshoot) are obtained. As applications, we pr…
Instantaneous volatility of logarithmic return in the lognormal fractional SABR model is driven by the exponentiation of a correlated fractional Brownian motion. Due to the mixed nature of driving Brownian and fractional Brownian motions, probability density for such a model is less studied in the literature. We show i…
Novel ML approach solves complex warehouse routing problem.
problem Efficiently routing pickers in mixed-shelves warehouses.
method Hierarchical and parallel multi-agent reinforcement learning.
result State-of-the-art performance in solution quality and inference speed.
A new framework models multi-state events and biomarkers.
problem Limited representation of complex multi-state trajectories.
method General multi-state joint modeling framework.
result Accurate parameter recovery and personalized predictions.
New method for mixed data types in graphical models.
problem Challenges in analyzing data with mixed variable types.
method Latent Gaussian copula models with leveraged polychoric and polyserial correlations.
result Flexible and scalable methodology for mixed data types.
Proposes a new algorithm to estimate invariant subspaces across multilayer networks.
problem Estimating invariant subspaces across heterogeneous multiple networks.
method Bias-corrected joint spectral embedding algorithm that recursively calibrates diagonal bias and iteratively updates the subspace estimator.
result Established entrywise subspace perturbation bound and entrywise eigenvector central limit theorem for the algorithm.
Proposes IPT for modeling complex joint distributions.
problem Lack of closed-form solutions for complex continuous or mixed distributions.
method Observer-centered framework with three independence axioms; derivation of closed-form solutions.
result Closed-form solutions for complex joint distributions under IPT.
Novel upper bound for unsupervised domain adaptation considers joint error.
problem Addressing the issue of mixing samples from different classes when matching marginal distributions.
method Proposes a general upper bound that penalizes undesirable joint error, uses constrained hypothesis space, and introduces cross margin discrepancy.
result Our proposal outperforms related approaches in image classification error rates on domain adaptation benchmarks.
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.
In this paper will be applied some principles and methods from econophysics in the case of the direct foreign investitions (D.F.I.), particularised for the Greenfield type, and mixed firms of trade and industrial production (Joint Ventures). To this aim will be used some similarities and parallelisms between the mentio…
Paper optimizes battery storage in multiple energy markets for better profits.
problem Optimizing battery storage participation in multiple energy markets to balance supply and demand.
method Developed a joint bidding strategy combining intraday and frequency markets using mixed integer linear programming and a learned classifier strategy.
result The LCS increases overall profits by over 4% compared to static strategies and by more than 3% over a naive dynamic benchmark.
Given data over the joint distribution of two random variables X and Y, we consider the problem of inferring the most likely causal direction between X and Y. In particular, we consider the general case where both X and Y may be univariate or multivariate, and of the same or mixed data types. We take an inf…
KERMIT models sequences and pairs using a single neural network.
problem Efficient generative modeling for sequences and sequence pairs.
method Insertion-based approach using a single neural network.
result Unified model capable of matching or exceeding state-of-the-art performance.
Improved VI method for deep mixed models in finance.
problem Inaccurate and slow variational inference in high dimensions.
method Natural gradient hybrid VI method targeting joint posterior.
result Natural gradient method is faster and more accurate than existing methods.
Mixed-integer programming solves systemic risk measures for interdependent financial systems.
problem Computing systemic risk measures for interdependent financial systems with joint risk considerations.
method Proposes a mixed-integer programming problem to compute clearing vectors in a Rogers-Veraart network model with unrestricted sign operating cash flows.
result The proposed mixed-integer programming problem can compute systemic risk measures for interdependent financial systems.
Estimates mixing coefficients of geometrically ergodic Markov processes from a single sample path.
problem Estimating mixing coefficients of geometrically ergodic Markov processes.
method Proposes methods to estimate β-mixing coefficients from a single sample path under standard smoothness conditions. result Obtains a rate of convergence of order \(\mathcal{O}(\log(n) n^{-[s]/(2[s]+2)})\) for the expected error of the estimator.
Kernel-based tests detect dependencies in multivariate time series, including stationary and non-stationary data.
problem Detecting dependencies in multivariate time series data, especially non-stationary data.
method Kernel-based statistical tests of joint independence, extending dHSIC to handle both stationary and non-stationary processes.
result Robustly uncovers significant higher-order dependencies in synthetic and real-world data.
Improved Q-learning for multi-agent reinforcement learning by weighting joint action values.
problem QMIX restricts Q-values to monotonic mixtures, limiting complex value functions. method Introduced weighted projection to recover optimal policies, improving performance.
result CW QMIX and OW QMIX outperform baseline QMIX on multi-agent tasks.
Gibbs sampler contracts entropy under strong log-concavity, improving mixing time.
problem Improving the mixing time of Gibbs sampler under strong log-concavity.
method Analyzing Gibbs sampler contraction under strong log-concavity, providing sharp contraction rate.
result Gibbs sampler contracts entropy linearly with condition number and independent of dimension under strong log-concavity.
Proposes an exact slice sampler for HDP and its mixture models.
problem Challenges in sampling from Hierarchical Dirichlet Process (HDP) models.
method Bayesian variable augmentation to address hierarchical nature of HDPs, resulting in a full factorization of the joint distribution suitable for slice sampling.
result Fast mixing and natural truncation of infinite measures without ad-hoc modifications.
Optimizes risk assessment tools using mixed-integer programming.
problem Challenges in healthcare risk assessment due to label scarcity and asymmetric misclassification costs.
method Jointly optimizes scoring weights and category thresholds via mixed-integer programming (MIP).
result Prevents label-scarce category collapse and achieves more accurate risk categorization.
Improves Bayesian optimization efficiency for mixed variable spaces.
problem Boosting sample efficiency in Bayesian optimization for mixed variable spaces.
method Proposes frequency modulated (FM) kernels to model complex dependencies across different types of variables.
result BO-FM outperforms competitors in various optimization problems.
sGLMM corrects genetic associations with complex relatedness and confounding.
problem Correcting spurious associations in complex genetic data with population stratification and relatedness.
method Sparse graph-structured linear mixed model (sGLMM) that incorporates relatedness information and confounding correction.
result sGLMM outperforms existing approaches in modeling correlation from population structure and shared signals.
Method estimates joint distribution of bivariate outcomes.
problem Modeling dependence between bivariate outcomes.
method Semiparametric distribution regression.
result Method performs similarly or better than alternatives in finite samples.