A new GP method handles both qualitative and quantitative factors using latent variables.
problem Handling both qualitative and quantitative inputs in simulations.
method Mapping qualitative factors to latent variables and treating them similarly to numerical variables.
result Superior predictive performance across various examples.
New method integrates latent variables for Bayesian Optimization of materials with both qualitative and quantitative factors.
problem Bayesian Optimization for materials design with mixed qualitative and quantitative variables.
method Integrates latent variables for mixed-variable Gaussian process modeling within the Bayesian Optimization framework.
result LVGP provides superior modeling accuracy compared to existing methods for mixed-variable problems.
Study uses LLMs to improve financial forecasting by integrating textual and numerical data.
problem Challenges in fusing multimodal information and measuring qualitative outputs from LLMs.
method Created context sets by segmenting daily securities reports into key factors and combining them with numerical data. Used dynamic updates and crafted prompts to assign scores to qualitative insights.
result LLMs outperform time-series models in market forecasting, though challenges remain.
The study examines the dynamic behavior of RMSprop and Adam algorithms.
problem Understanding the training loss curve patterns of adaptive gradient algorithms.
method Careful numerical experiments and theoretical explanations using the signGD flow.
result Adam converges smoother and faster when momentum factors are close to each other.
Meta-causal states group equivalent qualitative causal dynamics, useful for analyzing system changes.
problem Qualitative changes in causal relationships due to agent actions or environmental tipping points.
method Propose meta-causal states to group causal models based on equivalent qualitative behavior and parameterize specific mechanisms.
result Meta-causal states can be inferred from observed agent behavior and disentangled from unlabeled data.
Develops fully Bayesian LVGP for better uncertainty quantification.
problem Uncertainty in qualitative inputs for GP models.
method Maps qualitative inputs to latent variables, uses standard GP over LVs, estimates LVs through ML, develops fully Bayesian approach.
result Significant improvements in prediction accuracy and uncertainty quantification over plug-in approach.
Study finds key investing characteristics for success in equity markets.
problem Understanding what traits lead to financial success in equity markets.
method Exploratory factor analysis and multiple linear regression on 403 respondents' data.
result Investing characteristics significantly impact individual investors' excess return.
New algorithm identifies multiple medical conditions from EHRs.
problem Automatically phenotyping multiple medical conditions from clinical notes.
method Constrained Non-Negative Matrix Factorization (NMF) with domain-specific constraints.
result Learned phenotypes are clinically interpretable and predictive of mortality.
We study the dynamics of correlation and variance in systems under the load of environmental factors. A universal effect in ensembles of similar systems under the load of similar factors is described: in crisis, typically, even before obvious symptoms of crisis appear, correlation increases, and, at the same time, vari…
New model explains price dynamics of Bitcoin with psychological factors.
problem Understanding price variations in cryptocurrency markets with psychological factors.
method Extended agent-based model with heterogeneous psychological parameters.
result Model shows diverse dynamics based on psychological correlation.
Variational method learns disentangled latent factors from unlabeled data.
problem Learning disentangled latent factors from unlabeled data.
method Variational inference with a disentanglement regularizer and metric.
result Significant improvement in disentanglement and data likelihood.
Plug-in method decomposes latent representations into interpretable factors.
problem Decomposing latent representations in neural networks without altering the original models.
method Factors' Decomposer-Entangler Network (FDEN) that learns to decompose latent representations into mutually independent factors.
result FDEN framework effectively decomposes latent representations into interpretable factors, maintaining original model integrity.
Bayes-Factor-VAE models improve disentanglement of latent factors in data.
problem Disentangling latent factors in data using standard Gaussian priors is suboptimal.
method Introduced hierarchical Bayesian deep auto-encoder models with hyper-priors on latent variances.
result Bayes-Factor-VAEs outperform existing methods in latent disentanglement.
A new VAE model learns disentangled latent factors without supervision.
problem Learning disentangled latent representations in unsupervised settings.
method Relevance-Factor-VAE model using total correlation and relevance indicators.
result Demonstrates superior disentanglement performance across multiple datasets.
Unsupervised method discovers object landmarks by factorizing image deformations.
problem Learning object structure in unsupervised settings.
method Factorizing image deformations to learn landmarks consistently across different viewpoints and object deformations.
result Learned landmarks establish meaningful correspondences between different object instances without explicit requirement.
A framework for disentangling class-related and class-independent factors in data.
problem Learning disentangled representations in variational autoencoders.
method Attention mechanism in latent space, mixture models, Bhattacharyya coefficient, semi-supervised training.
result Disentangles class-related and class-independent factors of variation.
Paper proposes VAE-BPTF for better tensor factorization of sparse, imbalanced count data.
problem Inference of Bayesian Poisson-Gamma models for sparse and imbalanced count data is challenging.
method Variational auto-encoder framework with multi-layer perceptron networks for complex update information sharing and reweighting.
result VAE-BPTF outperforms current models in reconstruction errors and latent factor coherence across real-world datasets.
We present a general methodology to incorporate fundamental economic factors to our previous theory of herding to describe bubbles and antibubbles. We start from the strong form of Rational Expectation and derive the general method to incorporate factors in addition to the log-periodic power law (LPPL) signature of her…
MGLM models all possible language channel factorizations for improved multilingual generation.
problem Generating multilingual text with flexibility and quality.
method Generative joint distribution model over language channels, marginalizing all possible factorizations.
result MGLM outperforms traditional models in multilingual generation tasks.
A new method clusters qualitative data with mixed variables, improving interpretability.
problem Clustering qualitative data with context and high-dimensional mixed datasets.
method Hierarchical Qualitative Clustering (HQC) using Maximum Mean Discrepancy.
result HQC maintains interpretability of qualitative information and clusters effectively.
New algorithm for dueling bandits with qualitative feedback outperforms existing methods.
problem Qualitative feedback in dueling bandits.
method Direct algorithms using qualitative feedback probabilities.
result Proposed algorithms significantly outperform existing DB algorithms.
Modeling dynamic user interests using neural matrix factorization.
problem Challenging extraction of valuable insights from unstructured, high-dimensional, and dynamic online content data.
method Combines matrix factorization with neural networks to model nonlinear user and content factors.
result Accurately identifies nuanced and coherent consumption patterns of Boston Globe readers over five years.
Model learns disentangled, interpretable representations from sequential data without supervision.
problem Learning disentangled and interpretable representations from sequential data without supervision.
method Factorized hierarchical variational autoencoder with multi-scale priors.
result Model outperforms i-vector baseline in speaker verification and reduces word error rate by 35% in mismatched scenarios.
Topic-aware chatbot learns from NMF topic vectors.
problem Improving chatbot relevance based on user topics.
method Combines RNN with NMF for topic learning and attention.
result Chatbot provides more relevant answers based on topic.
Robo-advisors estimate clients' risk aversion using interactive questionnaires.
problem Estimating risk aversion of non-expert clients using adaptive questionnaires.
method Model risk aversion with cost functions and spectral risk measures. Use inverse reinforcement learning to design questions maximizing distinguishing power.
result Designing questions by maximizing distinguishing power achieves satisfactory accuracy in learning risk aversion with fewer than 50 questions.
PVAE learns disentangled representations from multimodal data.
problem Learning disentangled representations from multimodal sensory data.
method Partitioned Variational Autoencoder (PVAE) with multimodal generative model and training objectives.
result PVAE achieves over 99% accuracy on both modalities for semantic units.
This paper explores semi-qualitative probabilistic networks (SQPNs) that combine numeric and qualitative information. We first show that exact inferences with SQPNs are NPPP-Complete. We then show that existing qualitative relations in SQPNs (plus probabilistic logic and imprecise assessments) can be dealt effectively …
Random matrix theory predicts neural representations generalize well.
problem Understanding why neural representations generalize well in practice.
method Applied random matrix theory to kernel regression and neural networks.
result GCV estimator accurately predicts generalization risk in overparameterized settings.
A new geometrically-motivated algorithm for nonnegative matrix factorization is developed and applied to the discovery of latent "topics" for text and image "document" corpora. The algorithm is based on robustly finding and clustering extreme points of empirical cross-document word-frequencies that correspond to novel …
In risk management it is desirable to grasp the essential statistical features of a time series representing a risk factor. This tutorial aims to introduce a number of different stochastic processes that can help in grasping the essential features of risk factors describing different asset classes or behaviors. This pa…
Improved scalable training for FHVAE models.
problem Original FHVAE training is not scalable to large datasets.
method Proposed hierarchical sampling training algorithm.
result Improved scalability to datasets of thousands of hours.
Novel convex risk measures aggregate multiple uncertain sources for insurance firms.
problem Managing risk from multiple uncertain sources in insurance.
method Proposes convex risk measures based on Fréchet mean.
result Allows for robust risk characterization and closed-form expressions.
Spatially-aware metrics improve uncertainty evaluation in segmentation.
problem Uncertainty evaluation metrics treat voxels independently, ignoring spatial context.
method Proposed three spatially aware metrics incorporating structural and boundary information.
result Improved alignment with clinically important factors and better discrimination between uncertainty patterns.
Stochastic optimization's success linked to heavy-tailed noise.
problem Understanding stochastic optimization's success mechanisms.
method Modeling stochastic optimization as random recurrence relations, analyzing multiplicative noise and heavy-tailed behavior.
result Multiplicative noise leads to heavy-tailed stationary behavior in optimization parameters.
New framework for disentangling graph node and edge features.
problem Learning disentangled representations for attributed graphs with node and edge features.
method Proposes a novel variational objective and architecture for node and edge deconvolutions to disentangle latent factors.
result Demonstrates effectiveness of the proposed model and its extensions on synthetic and real-world datasets.
New method controls generative models with continuous factors.
problem Lack of control over generative models and poor understanding of latent space.
method Introduces a method to find meaningful directions in latent space for precise control of generated images.
result Demonstrates effectiveness of method for GANs and variational auto-encoders.
Cycles in causal learning cause feedback loops under intervention.
problem Cyclic causal structures lead to feedback loops in causal inference.
method Theoretical observations about self-referential distributions and their factorizations.
result Cyclic causal dependence can exist even when observational data suggest independence.
New theory for partial disentanglement from sparse graphs.
problem Disentangling latent factors from sparse causal graphs.
method Generalization of disentanglement theory to any graph, using consistency equivalence.
result Partial disentanglement captures expected factor entanglement based on graph structure.
We present the collaborative Kalman filter (CKF), a dynamic model for collaborative filtering and related factorization models. Using the matrix factorization approach to collaborative filtering, the CKF accounts for time evolution by modeling each low-dimensional latent embedding as a multidimensional Brownian motion.…
Classifies solutions to critical sixth order equations with a singularity.
problem Classifying entire positive singular solutions to critical sixth order equations.
method Integral sliding methods, qualitative analysis of ODEs, topological two-parameter shooting technique.
result Solutions are given by a singular radial factor times a periodic solution to a sixth order IVP with constant coefficients.
New algorithm learns interpretable CP-basis from streaming tensor data under Markovian constraints.
problem Learning interpretable CP-basis from streaming tensor data under Markovian constraints.
method Online Tensor Factorization (OTF) with CANDECOMP/PARAFAC (CP) decomposition, proving convergence to stationary points.
result Algorithm converges almost surely to stationary points of the objective function under Markovian data generation.
This paper introduces a new method to cluster qualitative attribute data using tree structures.
problem Clustering qualitative attribute data, especially when values are not in Euclidean space.
method Developed a joint learning mechanism to iteratively learn trees representing qualitative values' order relationships.
result The joint learning mechanism successfully clusters qualitative attribute data, yielding accurate results.
Qualitative analysis of MC dropout for NN model uncertainty.
problem Measuring uncertainty in neural network models.
method Mathematical formulation of Monte Carlo dropout and its benefits/costs in NN models.
result Potential benefits and associated costs of using MC dropout in NN models.
This paper compares two NUTS variants and analyzes their convergence and mixing times.
problem Theoretical comparison and convergence guarantees of NUTS variants.
method Deriving necessary and sufficient conditions for geometric ergodicity, and analyzing mixing times.
result NUTS-mul and NUTS-BPS have nearly identical qualitative behavior but differ quantitatively in convergence rates.
The study examines how model predictions hold up under model extensions.
problem Model predictions may not be robust under model extensions, limiting their applicability.
method The study uses causal ordering to assess robustness of qualitative model predictions and characterizes model extensions that preserve predictions.
result Conditions and techniques are provided to assess robustness of model predictions under model extensions.
Research examines motivations and factors influencing retailers' payment method choices.
problem Understanding motivations and factors affecting retailers' payment method choices.
method Qualitative and quantitative analysis of various factors including regulatory constraints, merchant service providers, and demographic variables.
result Lower interchange fees and regulatory constraints make card payment adoption financially feasible for merchants.
LMGPs extend GPs to handle mixed data, offering better accuracy and interpretability.
problem Handling mixed data types (quantitative and qualitative) in metamodeling.
method Introduce LMGPs that learn a latent manifold for qualitative inputs, using a low-rank linear map.
result LMGPs outperform existing methods in accuracy and versatility.
Support vector machines have attracted much attention in theoretical and in applied statistics. Main topics of recent interest are consistency, learning rates and robustness. In this article, it is shown that support vector machines are qualitatively robust. Since support vector machines can be represented by a functio…