Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

5.0%10.0%15.0%20.0% · Aug 199419922001200920172026
48 results for cross-modal mutual information

Paper proposes a new unsupervised method for cross-modality data translation without requiring direct mappings.

problem Tackles the challenge of zero-shot cross-modality data translation with fidelity.
method Mutual Information guided Diffusion cross-modality data translation Model (MIDiffusion) using score-matching and stochastic diffusion.
result Empirically shows advanced performance compared to other generative models.

Predicts whether an image is an abstraction of text or vice versa.

problem Understanding semantic cross-modal relations between images and text.
method Introduces a new metric (ABS) and a deep learning autoencoder approach to predict it.
result Demonstrates feasibility of predicting the relative abstractness level of image-text pairs.

New methods estimate point-wise dependency from neural MI models.

problem Estimating point-wise dependency between different events.
method Developed two methods: Probabilistic Classifier and Density-Ratio Fitting.
result Demonstrated effectiveness in MI estimation, self-supervised representation learning, and cross-modal retrieval.

DNN-based cross-modal retrieval has become a research hotspot, by which users can search results across various modalities like image and text. However, existing methods mainly focus on the pairwise correlation and reconstruction error of labeled data. They ignore the semantically similar and dissimilar constraints bet…

2017-03-21abs ↗pdf ↗

TAP transfers knowledge from unlabeled data to improve cross-modal learning.

problem Improving supervised learning performance using unlabeled data from a different modality.
method Probabilistic approach for missing information estimation, kernel regression, cross-attention module, TAP neural network.
result TAP significantly improves generalization across different domains and neural network architectures.

Knowledge Transfer (KT) techniques tackle the problem of transferring the knowledge from a large and complex neural network into a smaller and faster one. However, existing KT methods are tailored towards classification tasks and they cannot be used efficiently for other representation learning tasks. In this paper a n…

2018-03-28abs ↗pdf ↗

SBCA optimizes portfolios by fusing price data and text sentiment.

problem Insufficient integration of multi-modal information in traditional portfolio optimization models.
method Cross-modal BERT-driven Actor-Critic framework with gated fusion and constraint embedding.
result SBCA outperforms benchmarks in portfolio value, return, Sharpe ratio, and maximum drawdown.

New method identifies shared components from unpaired multimodal mixtures.

problem Identify shared components from unpaired multimodal mixtures.
method Distribution divergence minimization-based loss with sufficient conditions for identifiability.
result Sufficient conditions for shared component identifiability from unaligned multimodal mixtures.

Unified model learns joint and individual features from brain imaging data.

problem Integrating structural and functional connectivity data for behavioral phenotypes.
method Cross-Modal Joint-Individual Variational Network (CM-JIVNet) with multi-head attention fusion.
result CM-JIVNet outperforms in cross-modal reconstruction and behavioral trait prediction.

A novel cross-modal auto-encoder associates different data types efficiently.

problem Cross-modal data association in heterogeneous datasets.
method Bayesian inference framework with variational auto-encoders and associators.
result Successfully associates visual and auditory data with minimal paired data.

In this paper we propose cross-modal convolutional neural networks (X-CNNs), a novel biologically inspired type of CNN architectures, treating gradient descent-specialised CNNs as individual units of processing in a larger-scale network topology, while allowing for unconstrained information flow and/or weight sharing b…

2016-10-01abs ↗pdf ↗

The heterogeneity-gap between different modalities brings a significant challenge to multimedia information retrieval. Some studies formalize the cross-modal retrieval tasks as a ranking problem and learn a shared multi-modal embedding space to measure the cross-modality similarity. However, previous methods often esta…

2017-02-04abs ↗pdf ↗

PIMA autoencoders discover shared features in multimodal scientific data.

problem Discovering shared information in high-throughput scientific datasets.
method Physics-informed multimodal autoencoders (PIMA) with Gaussian mixture prior and product of experts formulation.
result Accurate cross-modal inference between images and mechanical stress-strain response in lattice metamaterials.

Paper describes profiles of multivariate normal distributions and novel estimators for mutual information.

problem Estimating mutual information for complex distributions.
method Analytical description of profiles, introduction of Bend and Mix Models, Monte Carlo estimation.
result Bend and Mix Models accurately estimate mutual information profiles and provide Bayesian estimates.

Improved bounds on learning algorithms' performance using conditional mutual information.

problem Bounding the generalization error of learning algorithms.
method Introducing conditional mutual information and disintegrated mutual information to tighten bounds.
result New bounds are tighter than previous ones, especially for noisy, iterative algorithms.

Paper benchmarks mutual info estimators on diverse distributions.

problem Evaluating mutual information estimators on complex, real-world distributions.
method Constructs a diverse family of known-ground truth distributions, proposes a benchmark platform.
result Highlights differences in classical and neural estimators' performance across various conditions.

MIM learns useful representations with high mutual information.

problem Learning useful representations for downstream tasks.
method Symmetric Jensen-Shannon divergence and mutual information regularizer in an encoder/decoder framework.
result MIM learns high mutual information representations without posterior collapse.

New method uses mutual info and network science to explain deep learning models.

problem Interpreting deep neural networks for understanding their decision-making process.
method Coupling mutual information with network science to quantify information flow in deep learning models.
result Proposed NIF technique for codifying information flow in deep learning models.

The paper argues that normalized mutual information is biased in clustering and community detection.

problem Bias in normalized mutual information for clustering and community detection.
method Introducing a modified version of mutual information to correct for information content and spurious dependence.
result The modified mutual information leads to different conclusions about which algorithms are best for community detection.

MHVAE learns cross-modality inference inspired by human cognition.

problem Cross-modality inference in multimodal data.
method Hierarchical multimodal generative model with modality-specific and joint-modality distributions.
result MHVAE performs on par with state-of-the-art models on multimodal datasets.

We find the maximum mutual information for neural networks and its key determinants.

problem Understanding the maximum mutual information in neural architectures.
method Derived closed-form expression for maximum mutual information across neural network families.
result Maximum mutual information stems from a generalized formula and is influenced by network width and statistical invariances.

New mutual information measure improves classification and community detection accuracy.

problem Standard mutual information measure can be inaccurate under real-world conditions.
method Corrected mutual information measure that accounts for all cases.
result Improved mutual information measure reduces errors in classification and community detection.

Measuring mutual information from finite data is difficult. Recent work has considered variational methods maximizing a lower bound. In this paper, we prove that serious statistical limitations are inherent to any method of measuring mutual information. More specifically, we show that any distribution-free high-confide…

2018-11-10abs ↗pdf ↗

MIM learns joint distributions with mutual information and low divergence.

problem Learning joint distributions over observations and latent variables.
method Probabilistic auto-encoder with three design principles: low divergence, high mutual information, and low marginal entropy.
result MIM learns representations with high mutual information, consistent encoding and decoding distributions, effective latent clustering, and comparable data log likelihood to VAE.

Softmax cross-entropy optimizes mutual information in neural networks.

problem Understanding the relationship between mutual information and classification neural networks.
method Demonstrated that optimizing softmax cross-entropy maximizes mutual information between inputs and labels.
result Softmax cross-entropy can approximate mutual information and highlight relevant image regions.

Proposes a new bound on generalization error using conditional mutual information.

problem Improving the generalization error bound in machine learning.
method Combines error decomposition and conditional mutual information techniques.
result New bound is order-wise better than previous ones in a simple Gaussian setting.

This paper studies mutual information in sequence models and finds Transformers excel in capturing long-range dependencies.

problem Understanding the expressive power of sequence models in capturing temporal dependencies.
method Theoretical and empirical analysis of linear and nonlinear RNNs, including Transformers.
result Transformers can capture long-range mutual information more efficiently than RNNs.

FlexCMH learns effective hashing codes from weakly-paired data.

problem Cross-modal hashing assumes perfect correspondence between samples, which is unrealistic.
method FlexCMH uses clustering-based matching to find potential correspondence and jointly optimizes it with hashing functions.
result FlexCMH achieves significantly better results than state-of-the-art methods.

Survey on LLMs for time series analytics across various domains.

problem Cross-modality gap between LLMs and time series data.
method Taxonomy of approaches, cross-modality strategies, and experiments on multimodal datasets.
result Effective combinations of textual data and cross-modality strategies enhance time series analytics.

The paper introduces submodular information measures for machine learning applications.

problem Generalizing information-theoretic measures to non-random variables.
method Developing combinatorial information measures based on submodular functions.
result Submodular mutual information is submodular in one argument for certain submodular functions.

Proposes a framework to maximize mutual information in VAE models for better latent code representation.

problem Lack of explicit measurement of the quality of learned representations in VAE models.
method Variational Mutual Information Maximization Framework for VAE.
result Maximizes mutual information between latent codes and observations, improving latent code representation.

CMTF improves financial market forecasting by fusing multiple data types.

problem Lack of effective integration of diverse financial data sources.
method Transformer-based deep learning framework with tensor interpretation and auto-training.
result CMTF outperforms classical and deep learning models in price direction classification.