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,657 papers · 148 categories

Trend · papers per month

18375573 · Jun 202019922001200920172026
48 results for multi-view autoencoders

Unified framework for multi-view autoencoders simplifies model implementation and evaluation.

problem Inconsistent notation and implementation of multi-view autoencoders.
method Unified mathematical framework, documentation, and Python library.
result Comparable or superior performance in benchmarking experiments.

DEMVC improves multi-view clustering with collaborative training and deep autoencoders.

problem Existing multi-view clustering methods have high computation and space complexities or lack representation capability.
method DEMVC learns embedded representations of multiple views individually using deep autoencoders and collaboratively trains all views.
result DEMVC achieves significant improvements over state-of-the-art methods on multi-view datasets.

Proposes a multi-view VAE for imputing missing data from correlated sources.

problem Imputing missing data from multi-view sources with latent space correlation.
method Enforces a joint prior with latent space correlation between VAEs trained on each view.
result More strongly correlated latent spaces are uncovered, enabling effective imputation.

DICCA maps multi-view data into a shared latent space with interpretable components.

problem Learning from multiple related but distinct data views.
method DICCA extends CCA to deep generative networks and uses sparsity-inducing priors for interpretability.
result DICCA effectively disentangles shared and view-specific variations in multi-view data.

Model integrates multi-view temporal data for better understanding of latent dynamics.

problem Understanding time-dependent heterogeneous properties from multi-view data.
method Generative model using variational autoencoder and recurrent neural network.
result Identifies disentangled latent embeddings across views while accounting for time factor.

We study the problem of learning to rank from multiple information sources. Though multi-view learning and learning to rank have been studied extensively leading to a wide range of applications, multi-view learning to rank as a synergy of both topics has received little attention. The aim of the paper is to propose a c…

2018-01-31abs ↗pdf ↗

A new algorithmic framework is proposed for learning autoencoders of data distributions. We minimize the discrepancy between the model and target distributions, with a \emph{relational regularization} on the learnable latent prior. This regularization penalizes the fused Gromov-Wasserstein (FGW) distance between the la…

2020-02-07abs ↗pdf ↗

SubTab turns tabular data into a multi-view problem for better representation learning.

problem Lack of structure in tabular data makes it hard to apply effective self-supervised learning methods.
method Divides tabular features into subsets and uses autoencoder-like reconstruction for collaborative inference.
result SubTab achieves state-of-the-art performance on tabular datasets, matching or surpassing CNN-based methods.

Finding the most effective way to aggregate multi-subject fMRI data is a long-standing and challenging problem. It is of increasing interest in contemporary fMRI studies of human cognition due to the scarcity of data per subject and the variability of brain anatomy and functional response across subjects. Recent work o…

2016-08-17abs ↗pdf ↗

Proposes MvLPE for better multi-view representation learning.

problem Learning representations from multi-view data with varying correlations.
method Integrates multi-view data into a centroid view while maintaining low-rank reconstruction relations.
result MvLPE outperforms existing methods on benchmark datasets.

Error-robust multi-view clustering tackles noisy data across multiple sources.

problem Error in multi-view data degrades clustering performance.
method Blind clustering without error consideration is ineffective. Various approaches like sparsity, graph, subspace, and deep learning are reviewed.
result Error-robust multi-view clustering improves clustering accuracy even with corrupted data.

Multi-view clustering is a learning paradigm based on multi-view data. Since statistic properties of different views are diverse, even incompatible, few approaches implement multi-view clustering based on the concatenated features straightforward. However, feature concatenation is a natural way to combine multi-view da…

2019-01-30abs ↗pdf ↗

Federated multi-view matrix factorization learns from multiple data sources without centralizing user data.

problem Cold-start federated recommendations and multi-view data structure.
method Federated learning framework extended to multi-view matrix factorization.
result Federated multi-view matrix factorization outperforms simpler methods in cold-start federated recommendations.

We propose a method to learn object representations from 3D point clouds using bundles of geometrically interpretable hidden units, which we call geometric capsules. Each geometric capsule represents a visual entity, such as an object or a part, and consists of two components: a pose and a feature. The pose encodes whe…

2019-12-06abs ↗pdf ↗

Proposes KMvDA for object recognition from multi-view data.

problem Recognizing objects from different views, even when views are heterogeneous.
method Introduces kernel multi-view discriminant analysis (KMvDA) and uses random Fourier features (RFF) for large-scale learning.
result KMvDA and RFF approximation improve object recognition from multi-view data.

Proposes a new multi-view graph learning framework to model consistency and inconsistency.

problem Graph learning methods often neglect inconsistency across multiple views, making them vulnerable to noisy datasets.
method Proposes a unified objective function to simultaneously model consistency and inconsistency, iteratively learning consistent and unified graphs.
result Demonstrates robustness and efficiency of the proposed approach on twelve multi-view datasets.

With advances in information acquisition technologies, multi-view data become ubiquitous. Multi-view learning has thus become more and more popular in machine learning and data mining fields. Multi-view unsupervised or semi-supervised learning, such as co-training, co-regularization has gained considerable attention. A…

2017-12-18abs ↗pdf ↗

PROTOCOL tackles imbalanced multi-view clustering by enhancing contrastive learning.

problem Class imbalance in real-world multi-view data.
method PROTOCOL uses partial optimal transport to perceive and mitigate imbalance, enhancing contrastive learning.
result PROTOCOL significantly improves clustering performance on imbalanced multi-view data.

Multi-view clustering is an important approach to analyze multi-view data in an unsupervised way. Among various methods, the multi-view subspace clustering approach has gained increasing attention due to its encouraging performance. Basically, it integrates multi-view information into graphs, which are then fed into sp…

2019-12-03abs ↗pdf ↗

Proposes a deep probabilistic multi-view model for multi-view learning.

problem Learning from multiple related views with shared latent structure.
method Probabilistic Canonical Correlation Analysis (CCA) in latent space, deep generative networks, variational inference.
result Efficient variational inference approximates posterior distributions of latent multi-view layer.

OpenViewer tackles multi-view learning challenges with interpretability and generalization.

problem Lack of interpretability and insufficient generalization in multi-view learning models.
method OpenViewer introduces a Pseudo-Unknown Sample Generation Mechanism, Expression-Enhanced Deep Unfolding Network, and Perception-Augmented Open-Set Training Regime.
result OpenViewer effectively addresses openness challenges and enhances recognition performance for both known and unknown samples.

While neural networks for learning representation of multi-view data have been previously proposed as one of the state-of-the-art multi-view dimension reduction techniques, how to make the representation discriminative with only a small amount of labeled data is not well-studied. We introduce a semi-supervised neural n…

2018-11-11abs ↗pdf ↗

Multiple clustering aims at exploring alternative clusterings to organize the data into meaningful groups from different perspectives. Existing multiple clustering algorithms are designed for single-view data. We assume that the individuality and commonality of multi-view data can be leveraged to generate high-quality …

2019-05-13abs ↗pdf ↗

Multi-view clustering has received much attention recently. Most of the existing multi-view clustering methods only focus on one-sided clustering. As the co-occurring data elements involve the counts of sample-feature co-occurrences, it is more efficient to conduct two-sided clustering along the samples and features si…

2019-05-25abs ↗pdf ↗

New method clusters multi-view data by squeezing hybrid knowledge.

problem Removal of redundant information and fusion of multi-view features.
method Low-rank subspace multi-view clustering with adaptive graph regularization.
result Our method outperforms state-of-the-art algorithms on multi-view benchmarks.

Proposes CRG_IMSC for better clustering of multi-view data.

problem Lack of effective connectivity in clustering results.
method Directly obtains clustering result with nonnegative constraint; constructs connectivity matrix based on spectral clustering result; uses multiplicative update algorithm.
result Improves clustering performance on benchmark datasets.

Proposes a method to enhance multi-view learning by maximizing higher order correlations.

problem Losing intrinsic interconnections among multiple views in pairwise correlation maximization.
method Formulates multi-view data as a low rank approximation problem using higher order correlation tensor and solves it with the generating polynomial method.
result Consistently outperforms prior methods on real multi-view data.

Multi-view clustering aims at integrating complementary information from multiple heterogeneous views to improve clustering results. Existing multi-view clustering solutions can only output a single clustering of the data. Due to their multiplicity, multi-view data, can have different groupings that are reasonable and …

2019-11-26abs ↗pdf ↗

New PAC-Bayesian bounds for multi-view learning using Rényi divergence.

problem Applying PAC-Bayesian theory to multi-view learning.
method Introducing novel PAC-Bayesian bounds based on Rényi divergence for multi-view learning.
result Efficient optimization algorithms that align with theoretical bounds.

This paper analyzes multi-view learning using information theory to improve generalization.

problem Lack of theoretical understanding of multi-view learning's generalization behavior.
method Developed information-theoretic generalization bounds for multi-view learning.
result Capturing both consensus and complementary information maximizes representation disentanglement.

Traditional multi-view learning approaches suffer in the presence of view disagreement,i.e., when samples in each view do not belong to the same class due to view corruption, occlusion or other noise processes. In this paper we present a multi-view learning approach that uses a conditional entropy criterion to detect v…

2012-06-13abs ↗pdf ↗

Proposes a novel method to identify complex effects in multi-view datasets.

problem Challenges in analyzing multi-view biomedical datasets with complex interactions.
method Generalized kernel machine approach considering marginal and joint effects of features from different views.
result Effective identification of higher-order composite effects in multi-view datasets.

We propose a new approach, multi-view Laplacian support vector machines (SVMs), for semi-supervised learning under the multi-view scenario. It integrates manifold regularization and multi-view regularization into the usual formulation of SVMs and is a natural extension of SVMs from supervised learning to multi-view sem…

2013-07-26abs ↗pdf ↗

Beyond existing multi-view clustering, this paper studies a more realistic clustering scenario, referred to as incomplete multi-view clustering, where a number of data instances are missing in certain views. To tackle this problem, we explore spectral perturbation theory. In this work, we show a strong link between per…

2019-05-31abs ↗pdf ↗

Proposes a method for multi-view clustering that integrates consistent and complementary graph regularizers.

problem Multi-view clustering where views have both consistent and complementary information.
method Consistent and complementary graph-regularized multi-view subspace clustering (GRMSC).
result The proposed method outperforms state-of-the-art methods on benchmark datasets.

We propose a nonparametric Bayesian probabilistic latent variable model for multi-view anomaly detection, which is the task of finding instances that have inconsistent views. With the proposed model, all views of a non-anomalous instance are assumed to be generated from a single latent vector. On the other hand, an ano…

2014-11-13abs ↗pdf ↗