The paper improves risk bounds for learning multiple components with sparsity-inducing regularization.
problem Learning multiple components with sparsity-inducing regularization.
method Derives efficient error bounds using known decompositions of Rademacher complexity.
result Proposes a method to derive tighter risk bounds without excessive effort.
System learns to combine multiple model components for personalized text generation.
problem Adapting and biasing language models for personal preferences.
method Combines model-defined components, learns activation and probability combination from unlabeled text.
result Directly generates text with personalized components from unlabeled data.
The paper studies multiple descent in multi-component prediction models.
problem Understanding the risk curves in multi-component prediction models.
method Investigates a 'double random feature model' and 'multiple random feature model' in ridge regression.
result Risk curves of multi-component prediction models can exhibit multiple descents.
msPCA solves sparse PCA for multiple components efficiently.
problem Sparse principal component analysis with multiple components.
method Alternating maximization algorithm for sparse loading vectors, with orthogonality or zero correlation constraints.
result Achieves high variance explained with sparse components and controlled feasibility violations.
We propose a novel adaptive learning algorithm based on iterative orthogonal projections in the Cartesian product of multiple reproducing kernel Hilbert spaces (RKHSs). The task is estimating/tracking nonlinear functions which are supposed to contain multiple components such as (i) linear and nonlinear components, (ii)…
ST-MTM models complex time series by decomposing and masking seasonal and trend components.
problem Forecasting complex time series with intricate temporal variations.
method Seasonal-Trend Decomposition with Masking and Contrastive Learning.
result ST-MTM achieves superior forecasting performance compared to existing methods.
Describes curves on surfaces with punctures and boundaries.
problem Representing multiple curves on surfaces with punctures and boundaries.
method Using geometric intersection numbers with embedded curves.
result Each multiple curve can be uniquely described.
MCCA extracts shared structure from multiple tensor datasets.
problem Extracting shared structure from multiple tensor datasets.
method Multilinear common component analysis (MCCA) using Kronecker products of mode-wise covariance matrices.
result MCCA constructs a common basis that retains information from multiple tensor datasets.
New method estimates effects of multiple nutrients on blood glucose.
problem Estimating physiological response to multiple nutrient treatments.
method Convolution-based multi-output Gaussian process model.
result Improved prediction accuracy and better interpretation of individual nutrient effects.
New method recovers latent sources from multiple noisy views using deep neural networks.
problem Recovering a common latent source from multiple nonlinearly mixed views.
method Novel identifiability proofs using deep neural networks.
result Independent latent sources can be recovered from multiple noisy views using deep neural networks.
Paper proposes a robust framework for detecting multiple periodic components in time series.
problem Detecting multiple periodic components in time series with interlaced patterns and external noise.
method Applying maximal overlap discrete wavelet transform to isolate periodic components, ranking them by wavelet variance, and detecting single periodicity robustly.
result The proposed algorithm outperforms other methods for both single and multiple periodicity detection.
The paper explores fairness in multi-component recommender systems.
problem How to ensure fairness in recommender systems composed of multiple models.
method Study of fairness ranking metrics, theoretical analysis, and empirical evaluation.
result Fairness in recommendation systems can be achieved by improving individual components.
This work explains how maximizing latent correlations across multiple data views helps in identifying shared and private components.
problem Understanding how to identify shared and private components in multiview data.
method An intuitive generative model of multiview data is adopted, and latent correlation maximization is shown to guarantee the extraction of shared components.
result Latent correlation maximization guarantees the extraction of shared components across views and disentangles private information.
RSPFs combine multiple SPNs for better density estimation.
problem Creating large SPNs for complex data.
method Random sum-product forests with residual links.
result RSPFs outperform individual SPNs and improve with residual links.
New ICA method improves on existing techniques.
problem Finding independent components in data.
method Multiple-weighted Independent Component Analysis (MWeICA) based on approximate diagonalization of weighted covariance matrices.
result MWeICA achieves better results than state-of-the-art ICA methods with similar computational time.
We consider the following multi-component sparse PCA problem: given a set of data points, we seek to extract a small number of sparse components with disjoint supports that jointly capture the maximum possible variance. These components can be computed one by one, repeatedly solving the single-component problem and def…
Study reveals structure of local minima in GMMs, identifying key cluster centers.
problem Identifying optimal cluster centers in non-convex GMM landscapes.
method Analyzing the negative log-likelihood function of GMMs in the population limit.
result Local minima share a common structure that partially identifies true cluster centers.
Improves statistical learning bounds with self-concordant losses.
problem Statistical prediction with nuisance components.
method Orthogonal statistical learning with self-concordant loss.
result Non-asymptotic bounds on excess risk improved by a dimension factor.
Correlated component analysis as proposed by Dmochowski et al. (2012) is a tool for investigating brain process similarity in the responses to multiple views of a given stimulus. Correlated components are identified under the assumption that the involved spatial networks are identical. Here we propose a hierarchical pr…
A hybrid loss framework improves time series forecasting by balancing global and component errors.
problem Current time series methods may prioritize less significant sub-series, leading to forecasting bias.
method Proposes a hybrid loss framework combining global and component losses, dynamically adjusting weights.
result Improves time series forecasting performance by 0.5-2% on average.
G-FuNK learns solutions for nonlinear PDEs on multiple domains and parameters.
problem Predicting time-dependent dynamics of complex systems governed by nonlinear PDEs with varying parameters and domains.
method Graph Fourier Neural Kernels combining domain-adapted and transferable components for non-diffusive and diffusive terms.
result G-FuNK achieves low relative errors on unseen domains and fiber fields, significantly accelerating predictions.
Improved estimation of multiple principal components using manifold optimization and iterative deflation techniques.
problem Estimating multiple principal components efficiently and orthogonally.
method Extended SFPCA using manifold optimization and iterative deflation techniques.
result Alternative deflation schemes improve signal extraction and component estimation.
Eigen component analysis combines quantum mechanics with machine learning for efficient data analysis.
problem Efficiently extracting linearly separable components from complex data.
method Eigen component analysis (ECA) incorporates quantum mechanics principles into linear learning models.
result ECA outperforms classical linear models and can be integrated with deep neural networks.
The increased availability of the multi-view data (data on the same samples from multiple sources) has led to strong interest in models based on low-rank matrix factorizations. These models represent each data view via shared and individual components, and have been successfully applied for exploratory dimension reduct…
Constructs initial data for multiple black holes with specified ADM parameters.
problem Forming multiple black holes with specific ADM parameters.
method Smooth, asymptotically flat vacuum initial data with prescribed ADM energy, momentum, and angular momentum.
result Maximal development of data results in spacetimes containing multiple black holes.
Gradient descent with growing learning rate enables learning non-linear features in neural networks.
problem Learning non-linear features in two-layer neural networks.
method Using gradient descent with a learning rate that grows with the sample size.
result Multiple rank-one components emerge, each corresponding to a specific polynomial feature.
Principal component analysis (PCA) is widely used for feature extraction and dimensionality reduction, with documented merits in diverse tasks involving high-dimensional data. Standard PCA copes with one dataset at a time, but it is challenged when it comes to analyzing multiple datasets jointly. In certain data scienc…
In the current literature, the analytical tractability of discrete time option pricing models is guaranteed only for rather specific types of models and pricing kernels. We propose a very general and fully analytical option pricing framework, encompassing a wide class of discrete time models featuring multiple-componen…
New method solves sparse PCA for multiple components efficiently.
problem Sparse PCA for multiple orthogonal components.
method Reformulates orthogonality as rank constraints, uses semidefinite relaxations and bounds.
result Exact solutions with near-optimal variance explained and orthogonality.
Proposes a method to infer complex network topologies from multiple graphs.
problem Learning multiple graph Laplacian matrices from heterogeneous graph signals with intricate topological patterns.
method Structured fusion regularization and ADMM algorithm for efficient computation.
result Establishes a non-asymptotic bound of the estimation error and reflects the effect of key factors on convergence rate.
CASS separates mixed signals using autoencoders and adversarial learning.
problem Separating mixed signals into individual components.
method Cross adversarial source separation via autoencoder framework.
result State-of-the-art performance in separating components with similar data structures.
Proposes a new model for mixed membership in Gaussian mixture.
problem Limited to single component membership in Gaussian mixture models.
method Mixed membership sub-Gaussian model, spectral algorithm.
result Estimation error can be made arbitrarily small with high probability.
New algorithm predicts multiple types of outputs with dependencies.
problem Predicting multiple diverse types of outputs.
method Problem transformation method combined with component-wise boosting.
result Sparse and interpretable learning of dependencies between targets.
Strictly stable Allen-Cahn hypersurfaces have multiplicity one.
problem Understanding the multiplicity of stable hypersurfaces in Allen-Cahn equations.
method Analyzing strictly stable components without variational assumptions.
result Strictly stable components occur with multiplicity one.
Proposes FMPCA for federated tensor data dimensionality reduction.
problem Integration of MPCA into federated learning.
method Federated Multilinear Principal Component Analysis (FMPCA).
result FMPCA preserves performance of traditional MPCA in federated learning.
Paper extends RPD for better handling multiple modalities and non-convexity.
problem Handling multiple modalities and non-convexity in data clouds.
method Computes RPD in a reproducing kernel Hilbert space using kernel principal component analysis.
result The method outperforms RPD and is comparable to other models on benchmark datasets.
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 method learns latent spaces from labeled data.
problem Identifying low-dimensional latent structures in high-dimensional data.
method Nonlinear multiple-response regression within an index model context.
result Unified method offers better interpretability and reduced computational complexity.
New DMEM models forecast volatility combining low- and high-frequency data.
problem Modeling realized volatility with both short- and long-term features.
method Doubly Multiplicative Error (DMEM) models combining daily and long-term data.
result DMEM models outperform existing GARCH-type models in forecasting.
The paper clusters group fairness metrics and visualizes them using PCA.
problem Measuring discrimination against socio-demographic groups using multiple metrics.
method Empirical observation and PCA visualization of fairness metrics.
result Group fairness metrics cluster into two or three main clusters.
We translate ML pipelines into neural networks to optimize multiple models together.
problem Isolated training of ML pipelines limits joint optimization of multiple models.
method Propose translating ML pipelines into neural networks and fine-tuning them jointly.
result Fine-tuning translated pipelines increases final accuracy.
Let M be a fibered 3-manifold with multiple boundary components. We show that the fiber structure of M transforms to closely related transversely oriented taut foliations realizing all rational multislopes in some open neighborhood of the multislope of the fiber. Each such foliation extends to a taut foliation in t…
This paper tackles sequential distribution shifts in representation learning.
problem Learning meaningful representations in a sequence of distribution shifts.
method Nonlinear Independent Component Analysis (ICA) framework for continual causal representation learning.
result The method achieves performance comparable to joint training on multiple offline distributions and shows no benefit from the incoming new distribution on all latent variables.
A new method for decision-focused learning reduces computational cost.
problem Efficiently solving combinatorial problems with uncertain parameters.
method Reframed as cost-sensitive multi-output regression, with novel loss components.
result Comparable downstream task quality with reduced computational cost.
Survey on Higgs bundle moduli spaces and their connected components.
problem Counting connected components of Higgs bundle moduli spaces.
method Analyzes moduli spaces for Higgs bundles associated with real Lie groups and closed Riemann surfaces.
result Explicit descriptions of some moduli space components are possible.
In many settings, we have multiple data sets (also called views) that capture different and overlapping aspects of the same phenomenon. We are often interested in finding patterns that are unique to one or to a subset of the views. For example, we might have one set of molecular observations and one set of physiologica…
The waggle dance that honeybees perform is an astonishing way of communicating the location of food source. After over 60 years of its discovery, researchers still use manual labeling by watching hours of dance videos to detect different transitions between dance components thus extracting information regarding the dis…
Causal Component Analysis aims to recover latent variables with causal relationships.
problem Recover latent variables with causal relationships from observed mixtures.
method Introduces a likelihood-based approach using normalizing flows to estimate unmixing function and causal mechanisms.
result Demonstrates effectiveness through synthetic experiments in CauCA and ICA settings.