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.

168,982 papers · 148 categories

Trend · papers per month

3517021,0531,404 · Jun 202019922001200920172026
48 results for image-text modeling

Proposes STN for HDA by aligning domain-shared classifier and subspace.

problem Learning in target domain using knowledge from heterogeneous source domain.
method End-to-end learning of domain-shared classifier and domain-invariant subspace; soft-label strategy for unlabeled data; adaptive coefficient for soft-labels.
result Significantly outperforms state-of-the-art approaches in various transfer tasks.

Develops DDC to improve clustering with deep neural networks.

problem Low-level indiscriminative representations and lack of pattern relationships in traditional clustering methods.
method Introduces global and local constraints to a deep neural network for adaptive relationship estimation and high-level representation learning.
result DDC outperforms current methods on multiple datasets.

Unsupervised methods have proven effective for discriminative tasks in a single-modality scenario. In this paper, we present a multimodal framework for learning sparse representations that can capture semantic correlation between modalities. The framework can model relationships at a higher level by forcing the shared …

2015-11-19abs ↗pdf ↗

Proposes MR-SNE for multimodal data visualization.

problem Visualizing data from multiple domains with relations across them.
method Extends t-SNE to compute augmented relations and jointly embed them in a low-dimensional space.
result Demonstrates promising performance in visualizing Flickr and Animal with Attributes 2 datasets.

Estimates CATEs for structured treatments using a new decomposition method.

problem Estimating conditional average treatment effects for complex data types.
method Generalized Robinson decomposition, isolating causal estimand, arbitrary model plugging, quasi-oracle convergence guarantee.
result Demonstrates superior performance in CATE estimation compared to prior work.

While supervised learning has enabled great progress in many applications, unsupervised learning has not seen such widespread adoption, and remains an important and challenging endeavor for artificial intelligence. In this work, we propose a universal unsupervised learning approach to extract useful representations fro…

2018-07-10abs ↗pdf ↗

Classifies and constructs intertwining differential operators between line and vector bundles over real projective space.

problem Classifying and constructing intertwining differential operators between line and vector bundles over real projective space.
method F-method for classification and construction of intertwining differential operators.
result Generalizes a classical result of Bol for SL(2,R)SL(2,\mathbb{R}) and classifies intertwining operators for SL(n,R)SL(n,\mathbb{R}).

CLIP learns joint image-text representations for zero-shot learning.

problem Understanding and improving zero-shot transfer performance in CLIP.
method Formal study of transferrable representation learning and analysis of zero-shot transfer performance.
result Proposes a new CLIP-type approach that outperforms existing methods.

The paper classifies and constructs differential symmetry breaking operators from a line bundle to a vector bundle over real projective spaces.

problem Classifying and constructing differential symmetry breaking operators.
method Utilizing factorization identities and branching laws of generalized Verma modules.
result Differential symmetry breaking operators from a line bundle to a vector bundle over real projective spaces are classified and constructed.

Global pooling, such as max- or sum-pooling, is one of the key ingredients in deep neural networks used for processing images, texts, graphs and other types of structured data. Based on the recent DeepSets architecture proposed by Zaheer et al. (NIPS 2017), we introduce a Set Aggregation Network (SAN) as an alternative…

2018-10-03abs ↗pdf ↗

We propose JECL, a method for clustering image-caption pairs by training parallel encoders with regularized clustering and alignment objectives, simultaneously learning both representations and cluster assignments. These image-caption pairs arise frequently in high-value applications where structured training data is e…

2019-01-04abs ↗pdf ↗

This research explores how different discrete diffusion kernels affect graph generation quality.

problem The impact of different discrete diffusion kernels on graph generation quality.
method Developed a family of discrete diffusion kernels that converge to different Bernoulli priors.
result The quality of generated graphs is sensitive to the prior used, challenging previous intuitions.

The paper discusses quantifying realism in generated images.

problem Designing functions to reliably distinguish realistic data from unrealistic data.
method Drawing on insights from algorithmic information theory, the paper introduces the notion of a universal critic.
result A good generative model alone is insufficient to solve the problem of realism quantification.

Generates coherent storybooks from plain text using diffusion models.

problem Ensuring coherency in a sequence of images for storytelling applications.
method Combines pre-trained LLM and text-guided Latent Diffusion Model for zero-shot generation.
result Outperforms state-of-the-art image editing baselines in generating coherent storybooks.

New method improves neural network performance by focusing on steep function regions.

problem Improving neural network performance by focusing on steep function regions.
method Variance Based Samples Weighting (VBSW) using labels local variance to weight training points.
result Significantly increases the performances of neural networks for various tasks.

FHDMs achieve optimal convergence in spherically supported data.

problem Statistical convergence properties of FHDMs for spherical data.
method FHDMs leverage random generation time and Doob's h-transform to optimize convergence rate.
result Achieve minimax optimal convergence rate in total variation for spherically supported Sobolev smooth data.

DreamFusion uses text-to-image diffusion models to create 3D images efficiently.

problem Lack of large-scale 3D datasets and efficient architectures for 3D synthesis.
method Adapting a 2D diffusion model to 3D synthesis using a loss based on probability density distillation.
result A 3D model can be optimized from a 2D diffusion model, allowing for text-to-3D synthesis.

BC-LLM uses LLMs to find concepts without predefined sets, improving interpretability and performance.

problem Finding a balance between interpretability and accuracy in concept extraction models.
method Bayesian approach with LLMs as both concept extractor and prior.
result BC-LLM outperforms interpretable and black-box models across various datasets.

This work generates diverse adversarial attacks for different domains using latent variable perturbation.

problem Adversarial attacks on deep neural networks are limited to a single perturbation.
method Frame adversarial attacks as learning a distribution of perturbations, enabling generation of diverse attacks.
result Framework generates competitive or superior adversarial attacks across diverse domains (images, text, graphs).

The paper introduces multimodal generative models to improve data marginal likelihood.

problem Improving data marginal likelihood in multimodal settings.
method Derives variational bounds on the evidence for multimodal deep generative models, generalizes objectives for different model types, and benchmarks across various datasets.
result Multimodal VAEs excel in image, label, and text datasets with and without weak supervision.

Masking diffusion outperforms other discrete diffusion models by incorporating jump times into the model.

problem Improving the performance of discrete diffusion models.
method Conditioning on the jump schedule of discrete Markov processes.
result Schedule-conditioned discrete diffusion (SCUD) models outperform classical and masking diffusion models.

Adversarial Robustness Toolbox (ART) is a Python library supporting developers and researchers in defending Machine Learning models (Deep Neural Networks, Gradient Boosted Decision Trees, Support Vector Machines, Random Forests, Logistic Regression, Gaussian Processes, Decision Trees, Scikit-learn Pipelines, etc.) agai…

2018-07-03abs ↗pdf ↗

The paper proves probabilistic alignment between unseen modalities using contrastive learning.

problem Aligning unseen modalities in unsupervised learning.
method Bayesian approach and direct comparison of contrastive representations.
result Direct comparison of contrastive representations recovers the same likelihood ratio as probabilistic graphical models.

In this paper we study output coding for multi-label prediction. For a multi-label output coding to be discriminative, it is important that codewords for different label vectors are significantly different from each other. In the meantime, unlike in traditional coding theory, codewords in output coding are to be predic…

2012-06-27abs ↗pdf ↗

Contrastive learning estimates transition kernels for continuous-time stochastic processes.

problem Estimating transition kernels for continuous-time stochastic processes without labeled data.
method Contrastive learning applied to strong-mixing continuous-time stochastic processes.
result Contrastive learning can estimate transition kernels for small-to-mid-range intervals in the diffusion case.

Study shows how to reduce data needed for learning under geometric constraints.

problem Learning high-dimensional data with geometric priors.
method Spherical harmonic decompositions and kernel methods for invariance and geometric stability.
result Improvements in sample complexity by leveraging group invariance, with asymptotic behavior depending on spectral properties.

We study how well one can recover sparse principal components of a data matrix using a sketch formed from a few of its elements. We show that for a wide class of optimization problems, if the sketch is close (in the spectral norm) to the original data matrix, then one can recover a near optimal solution to the optimiza…

2015-03-12abs ↗pdf ↗

FinZero improves financial time series forecasting accuracy with multimodal modeling.

problem Lack of interpretability, uncertainty, and scalability in financial time series forecasting.
method Developed a multimodal pre-trained model FinZero using UARPO method for reasoning, prediction, and uncertainty analysis.
result FinZero achieves an approximate 13.48% improvement in prediction accuracy over GPT-4o in high-confidence group.

SFM matches flows on statistical manifolds for better discrete generation.

problem Discrete generation on statistical manifolds with strong prior assumptions.
method Statistical Flow Matching (SFM) on manifold of categorical distributions using Fisher information metric.
result SFM achieves higher sampling quality and likelihood than other models.

SKADA-bench evaluates unsupervised DA methods across diverse modalities.

problem Evaluating unsupervised DA methods on diverse modalities with realistic validation.
method Nested cross-validation and unsupervised model selection scores.
result Highlights the importance of realistic validation and provides practical guidance.

Generates garden paintings from text descriptions using deep learning.

problem Lack of firsthand material for traditional Chinese garden reconstruction.
method Deep learning model trained on text and paintings of Ming Dynasty gardens.
result Model generates garden paintings in Ming Dynasty style based on textual descriptions.

Deep generative models have been praised for their ability to learn smooth latent representation of images, text, and audio, which can then be used to generate new, plausible data. However, current generative models are unable to work with molecular graphs due to their unique characteristics-their underlying structure …

2018-02-14abs ↗pdf ↗

The paper tackles calibrating long-term behaviors with multiple styles using programmatic style-consistency.

problem Generating long-term sequential behaviors with multiple styles simultaneously.
method Leverage programmatic labeling functions to specify controllable styles and derive style-consistency as a learning objective.
result Learned policies can be calibrated for up to 1024 distinct style combinations.

ZegOT uses optimal transport to zero-shot segment images with text prompts.

problem Zero-shot semantic segmentation with limited image-text alignment knowledge.
method ZegOT uses optimal transport to match multiple text prompts with frozen image embeddings.
result ZegOT achieves state-of-the-art performance in zero-shot semantic segmentation.