New method disentangles sources of different timescales in planetary seismic data.
problem Unsupervised source separation of multi-scale seismic data from planetary missions.
method Wavelet scattering spectra for multi-scale clustering and variational autoencoder for source separation.
result Disentangles sources with different timescales in InSight mission seismic data.
Optimizes black-box functions with varying costs across multiple sources.
problem Optimizing black-box functions with varying costs across multiple sources.
method Uses Augmented Gaussian Process and Gaussian Process to model fidelity and location-dependent costs, respectively. Uses Confidence Bound acquisition function to select sources and locations.
result The approach significantly outperforms existing methods on Hyperparameters Optimization tasks.
We present a novel blind source separation (BSS) method, called information geometric blind source separation (IGBSS). Our formulation is based on the log-linear model equipped with a hierarchically structured sample space, which has theoretical guarantees to uniquely recover a set of source signals by minimizing the K…
Proposes a framework to fuse heterogeneous data sources for better modeling.
problem Heterogeneous data sources with different input parameter spaces.
method Input mapping calibration (IMC) and latent variable Gaussian process (LVGP).
result Improved predictive accuracy over single source models.
ESS-Flow guides flow models without retraining, using Bayesian inference in source space.
problem Training flow models on paired data for conditional generation or sample production.
method Gradient-free Bayesian inference in source space using Elliptical Slice Sampling.
result Effective in diverse tasks including material design and protein structure prediction.
The paper establishes new Casorati inequalities for various Riemannian maps and submersions.
problem Developing new inequalities for Riemannian maps and submersions.
method Using general forms of Casorati inequalities, the paper derives inequalities for specific Riemannian spaces.
result The paper provides new Casorati inequalities for Riemannian maps and submersions.
PLRM synthesizes labels from mismatched sources for better training sets.
problem Creating labeled training sets is a major challenge in machine learning.
method PLRM uses probabilistic modeling to synthesize labels from indirect supervision sources with different output spaces.
result PLRM outperforms baselines by 2%-9% on various tasks.
For a germ of a smooth map f and a subgroup G_V of any of the Mather groups G for which the source or target diffeomorphisms preserve some given volume form V in the source or in the target we study the G_V-moduli space of f that parameterizes the G_V-orbits inside the G-orbit of f. We find, for example, that this modu…
We address the problem of unsupervised domain adaptation (UDA) by learning a cross-domain agnostic embedding space, where the distance between the probability distributions of the two source and target visual domains is minimized. We use the output space of a shared cross-domain deep encoder to model the embedding spac…
Study characterizes harmful low-fidelity data sources for surrogate models.
problem Identifying which low-fidelity data sources to use in constructing surrogate models.
method Employed benchmark filtering techniques to assess harmful sources using limited data.
result Provided guidelines for using low-fidelity sources in an industrial setting.
Integrates multiple datasets to solve open set crowdsourcing problems.
problem Crowdsourcing with unknown label space and unfamiliar tasks.
method Integrates multiple crowdsourced datasets, weights them based on category correlation, and uses open set transfer learning.
result Proves OSCrowd solves open set crowdsourcing problems and outperforms related solutions.
Deep neural networks suffer from performance decay when there is domain shift between the labeled source domain and unlabeled target domain, which motivates the research on domain adaptation (DA). Conventional DA methods usually assume that the labeled data is sampled from a single source distribution. However, in prac…
StrTransformer recovers sources without labels by optimizing latent matrices and enforcing structural constraints.
problem Unsupervised blind source recovery in signal processing.
method Source-wise structured Transformer framework with latent source matrix optimization, structural regularization, and branch-specific weights.
result StrTransformer learns distinct temporal-scale structures and recovers source-aligned latent trajectories.
Combines foundation models with weak supervision to improve NLP and video tasks.
problem Leveraging weak supervision with foundation models without labeled data.
method Liger, a combination of foundation model embeddings and weak supervision techniques.
result Liger outperforms existing weak supervision methods by 14.1 points on benchmark NLP and video tasks.
Algorithm adapts pretrained semantic segmentation models to new domains.
problem Adapting pretrained models to new, unlabeled domains without source data.
method Learn prototypical distribution in embedding space, align target domain with source domain.
result Method achieves competitive performance on benchmark tasks.
This paper proposes a multichannel source separation technique called the multichannel variational autoencoder (MVAE) method, which uses a conditional VAE (CVAE) to model and estimate the power spectrograms of the sources in a mixture. By training the CVAE using the spectrograms of training examples with source-class l…
LEARNER improves low-rank matrix estimation using source population data.
problem Improving low-rank matrix estimation in target populations with diverse data sources.
method LEARNER uses similarity in latent spaces between source and target populations to enhance estimation.
result LEARNER often outperforms benchmark methods, especially with higher signal-to-noise ratios in the source population.
Researchers can retrieve Yang-Mills-Higgs fields from Minkowski space measurements.
problem Retrieving Yang-Mills-Higgs fields from active local measurements in Minkowski space.
method Exploiting non-linear wave interactions and Lie algebra structure.
result Yang-Mills-Higgs fields can be retrieved from source-to-solution data.
In magnetoencephalography (MEG) the conventional approach to source reconstruction is to solve the underdetermined inverse problem independently over time and space. Here we present how the conventional approach can be extended by regularizing the solution in space and time by a Gaussian process (Gaussian random field)…
StrADiff separates sources from mixtures without labels, using structured priors.
problem Blind source separation of linear and nonlinear mixtures without labeled data.
method Structured Source-Wise Adaptive Diffusion Framework with Gaussian process priors.
result StrADiff can recover latent source trajectories in an unsupervised manner, especially stable in linear mixtures.
Proposes LVGP for multi-source data fusion in science and engineering.
problem Differences in quality and comprehensiveness of data sources.
method Latent Variable Gaussian Process (LVGP) framework.
result Improved predictions for sparse-data problems.
This paper studies the problem of Generalized Zero-shot Learning (G-ZSL), whose goal is to classify instances belonging to both seen and unseen classes at the test time. We propose a novel space decomposition method to solve G-ZSL. Some previous models with space decomposition operations only calibrate the confident pr…
Emission from a class of benzene-based molecules known as Polycyclic Aromatic Hydrocarbons (PAHs) dominates the infrared spectrum of star-forming regions. The observed emission appears to arise from the combined emission of numerous PAH species, each with its unique spectrum. Linear superposition of the PAH spectra ide…
New method restores source features for SFDA without source data.
problem Domain adaptation without access to source data.
method Feature Restoration (FR) and Bottom-Up Feature Restoration (BUFR).
result BUFR outperforms existing SFDA methods in accuracy, calibration, and data efficiency.
The study identifies two sources of invariants in 2--nondegenerate CR geometries.
problem Characterizing fundamental invariants of 2--nondegenerate CR geometries.
method Analyzes the harmonic curvature and the difference in complex structures.
result Nontrivial examples of CR geometries can be obtained as deformations of models.
Novel unsupervised audio source separation using generative priors.
problem Challenges of supervised methods in audio source separation.
method Generative priors trained on individual sources using projected gradient descent optimization.
result Effective recovery of constituent sources with good-quality estimates.
Due to space limitations, our submission "Source Separation and Clustering of Phase-Locked Subspaces", accepted for publication on the IEEE Transactions on Neural Networks in 2011, presented some results without proof. Those proofs are provided in this paper.
A new method for separating mixed signals in space and time.
problem Nonlinear and nonstationary spatio-temporal data challenges.
method Identifiable autoregressive variational autoencoder.
result The method outperforms existing techniques in blind source separation and spatio-temporal prediction.
We present a novel framework for domain adaptation, whereby both geometric and statistical differences between a labeled source domain and unlabeled target domain can be integrated by exploiting the curved Riemannian geometry of statistical manifolds. Our approach is based on formulating transfer from source to target …
Isolating individual instruments in a musical mixture has a myriad of potential applications, and seems imminently achievable given the levels of performance reached by recent deep learning methods. While most musical source separation techniques learn an independent model for each instrument, we propose using a common…
Prototype extraction framework for domain adaptation.
problem Statistical distance minimization issues in unsupervised domain adaptation.
method Memory and computation-efficient probabilistic framework for class prototype extraction and feature alignment.
result Competitive performance with state-of-the-art methods, no additional model parameters required.
Method transfers knowledge without label overlap, source data, or target architecture consistency.
problem Difficulties in transfer learning due to label mismatch, restricted source data, and specialized target architectures.
method Uses deep generative models in two stages: pseudo pre-training and pseudo semi-supervised learning.
result Outperforms scratch training and knowledge distillation methods.
Study homotopy groups of spaces of long links and knots, finding new generators.
problem Understanding homotopy groups of spaces of long links and knots.
method Graphing map increases dimensions, split injections from homotopy groups of spheres, and analyzing knotting effects.
result Generators for homotopy groups in a new degree for spaces of equidimensional long links.
Domain adaptation aims to leverage the supervision signal of source domain to obtain an accurate model for target domain, where the labels are not available. To leverage and adapt the label information from source domain, most existing methods employ a feature extracting function and match the marginal distributions of…
The paper tackles domain generalization using functional regression.
problem Learning a model that generalizes well across different source distributions.
method Functional regression approach to learn a linear operator between marginal and conditional distributions.
result The proposed algorithm achieves finite sample error bounds for the idealized risk.
Compared with shallow domain adaptation, recent progress in deep domain adaptation has shown that it can achieve higher predictive performance and stronger capacity to tackle structural data (e.g., image and sequential data). The underlying idea of deep domain adaptation is to bridge the gap between source and target d…
Given a set of heterogeneous source datasets with their classifiers, how can we quickly find the most useful source dataset for a specific target task? We address the problem of measuring transferability between source and target datasets, where the source and the target have different feature spaces and distributions.…
Paper tackles entity matching over multi-source data, optimizing alignment and mitigating negative transfer.
problem Learning effective entity matching models over multi-source large-scale data with relaxed assumptions.
method Proposes a Relaxed Multi-source Large-scale Entity-matching (RMLE) problem and Incentive Compatible Pareto Alignment (ICPA) method.
result Optimized cross-source alignments and mitigated negative transfer, improving entity matching accuracy.
The identification of sources of advection-diffusion transport is based usually on solving complex ill-posed inverse models against the available state- variable data records. However, if there are several sources with different locations and strengths, the data records represent mixtures rather than the separate influ…
Transfer reinforcement learning (RL) aims at improving the learning efficiency of an agent by exploiting knowledge from other source agents trained on relevant tasks. However, it remains challenging to transfer knowledge between different environmental dynamics without having access to the source environments. In this …
Paper unifies curvature concepts for Lie groupoids and algebroids.
problem Separate theories for Lie groups, bundles, and submersions.
method Using Lie groupoids with source-fibre metrics and Riemannian Lie algebroids.
result Derives sectional curvature formula for Lie groupoids and Lie algebroid curvature formulas.
A new machine learning method for Bayesian inverse problems in function spaces.
problem Bayesian inverse problems in function spaces with incompatibility of white noise sources.
method One-step generative transport with amortized neural operator and prior-aligned Gaussian random field.
result Generative operator trained on prior samples and noisy observations generates posterior samples efficiently.
Paper tackles open set domain adaptation by detecting unknown classes.
problem Adapting to target domains with unknown classes when label spaces partially overlap.
method Instance-level reweighting strategy combined with Extreme Value Theory for unknown class detection.
result Proposed method outperforms state-of-the-art models on conventional datasets.
Study on reliability of latent reuse in diffusion models under distribution shift.
problem When can latent spaces from a source dataset be reused for a target dataset with different distributions?
method Considered a source-target setting with approximately low-dimensional datasets near different subspaces. Analyzed the target-domain score error due to principal-angle misalignment and target ambient noise.
result Latent reuse is reliable only if the source and target subspaces are close and the target ambient noise is not too amplified.
In many practical applications, it is often difficult and expensive to obtain enough large-scale labeled data to train deep neural networks to their full capability. Therefore, transferring the learned knowledge from a separate, labeled source domain to an unlabeled or sparsely labeled target domain becomes an appealin…
Unified CLIP space manipulations improve GAN adaptation with a single target image.
problem Overfitting or underfitting in fine-tuning a pre-trained generator with a single target image.
method Two-step training strategy: latent optimization in CLIP space followed by generator fine-tuning with CLIP space consistency loss.
result Our model generates diverse outputs with the target texture and outperforms baseline models.
The paper tackles MSDA by learning dictionary atoms in Wasserstein space.
problem Mitigating data distribution shifts across multiple source domains to target domain.
method Dictionary learning and optimal transport in Wasserstein space; DaDiL algorithm for learning.
result Improved classification performance by 3.15%, 2.29%, and 7.71% in benchmarks.
The paper recasts Penrose-Sparling's non-Hausdorff twistor space using noncommutative geometry.
problem Reinterpreting Penrose-Sparling's non-Hausdorff twistor space.
method Introduces noncommutative geometry techniques to reinterpret the space, using explicit etale gluing groupoid and convolution algebra.
result The source-adapted cyclic pairing recovers the Coulomb charge, demonstrating the effectiveness of the new algebraic model.