This paper proposes a new method to improve domain adaptation by distinguishing between marginal and dependence structure differences.
problem Existing domain adaptation methods fail to differentiate between marginal and dependence structure differences, leading to suboptimal transferability.
method The paper introduces a new approach that measures and optimizes the differences in internal dependence structure separately from marginals.
result The new method significantly improves transferability and robustness compared to existing benchmarks on real-world datasets.
Paper tackles robust classification under class-dependent domain shift.
problem Class-dependent domain shift in machine learning.
method Defined a simple optimization problem with an information theoretic constraint and solved it using neural networks.
result Demonstrated that the proposed method can learn robust classifiers that generalize well to unseen domains.
Adversarial training is a useful approach to promote the learning of transferable representations across the source and target domains, which has been widely applied for domain adaptation (DA) tasks based on deep neural networks. Until very recently, existing adversarial domain adaptation (ADA) methods ignore the usefu…
Paper proves isoperimetric inequality for Minkowski spacetime.
problem Maximizing volume of domain of dependence for finite lightcone.
method Lorentz polarisation to study variational problem.
result Maximal volume achieved by spacelike hyperplane truncated finite lightcone.
Hybrid framework merges data and domain knowledge for better spatial interpolation.
problem Spatial interpolation overlooks domain knowledge and limits to spatial coordinates.
method Integrates data-driven features with rule-assisted spatial dependency function mapping.
result Superior performance in two application scenarios, capturing localized features.
Learning domain-invariant representation is a dominant approach for domain generalization (DG), where we need to build a classifier that is robust toward domain shifts. However, previous domain-invariance-based methods overlooked the underlying dependency of classes on domains, which is responsible for the trade-off be…
FreST Loss decorrelates spatio-temporal dependencies in graph signals.
problem Complex spatio-temporal dependencies in graph-structured signals are not well captured by standard forecasting models.
method FreST Loss extends supervision to the joint spatio-temporal spectrum using Joint Fourier Transform (JFT).
result FreST Loss reduces estimation bias and improves forecasting accuracy on real-world datasets.
Paper introduces MSA for weakly supervised covariance alignment in MEG signals.
problem Limited labeled signals in target datasets for MEG applications.
method Mixing model Stiefel Adaptation (MSA) leveraging unlabeled data.
result MSA outperforms recent methods in brain-age regression with MEG signals.
We prove that, given an acausal curve Γ in the boundary at infinity of AdS3 which is the graph of a quasi-symmetric homeomorphism φ, there exists a unique foliation of its domain of dependence D(Γ) by constant mean curvature surfaces with bounded second fundamental form. Moreover, these surfaces provide a fa…
Neural Laplace models diverse DEs in the Laplace domain for better dynamics.
problem Inadequate ODEs for long-range dependencies and discontinuities.
method Unified framework in Laplace domain, using stereographic map for smoothness.
result Superior performance in diverse DEs, including complex history dependency and abrupt changes.
The goal of cross-domain object matching (CDOM) is to find correspondence between two sets of objects in different domains in an unsupervised way. Photo album summarization is a typical application of CDOM, where photos are automatically aligned into a designed frame expressed in the Cartesian coordinate system. CDOM i…
The paper examines rigidity of thin domains under specific boundary conditions.
problem Linear geometric rigidity of shallow thin domains with zero Dirichlet boundary conditions.
method Analyzes two scaling regimes for ε in (h, √h] and (√h, 1), proving rigidity formulas.
result Rigidity does not depend on curvature in the small parameter regime ε ∈ (h, √h].
State representation learning (SRL) in partially observable Markov decision processes has been studied to learn abstract features of data useful for robot control tasks. For SRL, acquiring domain-agnostic states is essential for achieving efficient imitation learning. Without these states, imitation learning is hampere…
Given a hyperbolic domain, the nearest point retraction is a conformally natural homotopy equivalence from the domain to the boundary of the convex core of its complement. Marden and Markovic showed that if the domain is uniformly perfect, then there exists a conformally natural quasiconformal map which admits a bounde…
Domain adaptation is transfer learning which aims to generalize a learning model across training and testing data with different distributions. Most previous research tackle this problem in seeking a shared feature representation between source and target domains while reducing the mismatch of their data distributions.…
New model classes for function approximation by neural networks defined on domains.
problem Defining novel model classes for function approximation on bounded domains.
method Introducing weighted variation spaces to define new model classes on domains.
result New model classes are strictly larger than classical ones but maintain the same NNA rates.
Estimates binary labels from dependent data using Markov Random Fields.
problem Statistical estimation from dependent data across spatial, temporal, and social domains.
method Modeling dependencies as Markov Random Fields and providing efficient estimation algorithms.
result Statistically efficient estimation rates for Ising models from a single sample.
Develops deep models to handle nonstationary spatial extremal dependence.
problem Challenges in modeling nonstationary extremal dependence in spatial data.
method Deep compositional spatial models to capture nonstationarity in extremal dependence.
result Efficient estimation of warped space for nonstationary spatial data.
Generalizing the notion of domains of dependence in the Minkowski space, we define and study regular domains in the affine space with respect to a proper convex cone. In dimension three, we show that every proper regular domain is uniquely foliated by a particular kind of surfaces with constant affine Gaussian curvatur…
Unsupervised domain adaptation aims to generalize the hypothesis trained in a source domain to an unlabeled target domain. One popular approach to this problem is to learn domain-invariant embeddings for both domains. In this work, we study, theoretically and empirically, the effect of the embedding complexity on gener…
In this work we address the problem of transferring knowledge obtained from a vast annotated source domain to a low labeled target domain. We propose Adversarial Variational Domain Adaptation (AVDA), a semi-supervised domain adaptation method based on deep variational embedded representations. We use approximate infere…
Brain imaging data are important in brain sciences yet expensive to obtain, with big volume (i.e., large p) but small sample size (i.e., small n). To tackle this problem, transfer learning is a promising direction that leverages source data to improve performance on related, target data. Most transfer learning methods …
In the problem of domain adaptation for binary classification, the learner is presented with labeled examples from a source domain, and must correctly classify unlabeled examples from a target domain, which may differ from the source. Previous work on this problem has assumed that the performance measure of interest is…
The limit of energies of a sequence of harmonic maps as their annular domains approach the boundary of moduli space depends upon the boundary point approached. The infinite energy case is associated with limits of images containing ruled surfaces. The finite energy case yields a limit of images, under a suitable topolo…
In this paper, we introduce an approach for leveraging available data across multiple locales sharing the same language to 1) improve domain classification model accuracy in Spoken Language Understanding and user experience even if new locales do not have sufficient data and 2) reduce the cost of scaling the domain cla…
Mathematical approach defines stability conditions for ML models.
problem Ensuring stability of machine learning models.
method Adopted topological and metric spaces theory to define stability.
result Stability of ML models depends on topological properties of classification sets.
Paper proposes methods to improve graph domain adaptation by decorrelating node features.
problem Challenges in transferring knowledge from one graph to another.
method Proposes decorrelating node features using GCN and graph transformer layers.
result Significant performance enhancements and clear visualizations of learned representations.
Improved analysis of gradual domain adaptation with better generalization bounds.
problem Improving generalization in target domain through intermediate unlabeled domains.
method Analyzed gradual self-training under more general assumptions, proving a new generalization bound.
result Proved a significantly improved generalization bound of ε0 + O(TΔ + T/√n) + ˜O(1/√nT).
Sharp estimates for heat flow on nonconvex domains.
problem Quantitative estimates for heat flow on nonconvex domains.
method Sharp gradient and transport estimates with novel dependence on time.
result Equivalent characterization of lower bound on second fundamental form.
GrADE uses graph neural networks and Neural ODE for solving time-dependent nonlinear PDEs efficiently.
problem Solving time-dependent nonlinear PDEs is computationally challenging and time-consuming.
method GrADE combines graph neural networks for spatial modeling and Neural ODE for temporal modeling, using attention mechanisms.
result GrADE efficiently solves PDEs, demonstrating scalability and better accuracy compared to existing methods.
A major difficulty of solving continuous POMDPs is to infer the multi-modal distribution of the unobserved true states and to make the planning algorithm dependent on the perceived uncertainty. We cast POMDP filtering and planning problems as two closely related Sequential Monte Carlo (SMC) processes, one over the real…
HopCPT improves conformal prediction for time series with temporal dependencies.
problem Uncertainty quantification in time series data.
method HopCPT, a novel conformal prediction approach for time series that leverages temporal dependencies.
result HopCPT outperforms state-of-the-art methods on multiple real-world time series datasets.
Most transport theorems---that is, a formula for the rate of change of an integral in which both the integrand and domain of integration depend on time---involve domains that evolve according to a flow map. Such domains are said to be convecting. Here a transport theorem for nonconvecting domains evolving on an embedde…
Algorithm adapts to shifting domains with minimal label queries.
problem Adaptive learning in online machine learning systems with domain shifts.
method Adaptive algorithm balancing regret and label queries for hidden domains.
result Achieves lower regret compared to uniform and greedy queries.
In this paper we study the area of ideals triangles in a convex domain with its Hilbert geometry. We obtain a characterization of the hyperbolic geometry among all the Hilbert geometry in terms of area of ideals triangles. We also obtain a sharp lower bound on the hilbert area of ideal triangles, independant of the con…
Inertial information processing plays a pivotal role in ego-motion awareness for mobile agents, as inertial measurements are entirely egocentric and not environment dependent. However, they are affected greatly by changes in sensor placement/orientation or motion dynamics, and it is infeasible to collect labelled data …
New research on limits of transfer learning, proving key selection and dependence requirements.
problem Insufficient theoretical foundation for transfer learning.
method Proved novel results on transfer learning, emphasizing selection of information and dependence between domains.
result Upper bound on improvement possible with transfer learning, highlighting the need for careful selection.
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.
Aims to eliminate domain bias in authentication without domain labels.
problem Authentication models are biased due to domain differences.
method Discover latent domains and eliminate domain difference alternately, using a meta-learning framework.
result Eliminates domain difference in authentication without domain labels.
Network alignment is a critical task to a wide variety of fields. Many existing works leverage on representation learning to accomplish this task without eliminating domain representation bias induced by domain-dependent features, which yield inferior alignment performance. This paper proposes a unified deep architectu…
Domain adaptation is the supervised learning setting in which the training and test data are sampled from different distributions: training data is sampled from a source domain, whilst test data is sampled from a target domain. This paper proposes and studies an approach, called feature-level domain adaptation (FLDA), …
A new deep generative model captures global dependencies without supervision.
problem Global modeling in deep generative models.
method Non-i.i.d. variational autoencoders with mixture model and global Gaussian latent variable.
result Captures interpretable disentangled representations and domain alignment.
A new model for imputing missing values in time series data across domains.
problem Imputing missing values in time series data across domains with domain shifts and high missing rates.
method A diffusion-based imputation model that integrates shared spectral components and domain-specific temporal structures, with cross-domain consistency alignment.
result Our model effectively handles missing values and domain shifts, outperforming existing methods.
A new method uses deep learning to efficiently solve complex physics equations in high dimensions.
problem Efficiently solving high-dimensional time-dependent PDEs with dynamic solutions.
method Deep adaptive sampling framework for PINNs extended to spacetime domains using normalizing flows.
result The method effectively identifies and tracks high-residual regions in both space and time.
Graphical models have gained a lot of attention recently as a tool for learning and representing dependencies among variables in multivariate data. Often, domain scientists are looking specifically for differences among the dependency networks of different conditions or populations (e.g. differences between regulatory …
Nowadays, users open multiple accounts on social media platforms and e-commerce sites, expressing their personal preferences on different domains. However, users' behaviors change across domains, depending on the content that users interact with, such as movies, music, clothing and retail products. In this paper, we pr…
Novel bounds for deep MDA algorithms improve performance and efficiency.
problem Improving performance of MDA algorithms with few target labels and pseudo labels.
method Information-theoretic tools and novel deep MDA algorithm.
result Algorithm-dependent generalization bounds for MDA.
New DG method minimizes barycentric alignment and reconstruction loss.
problem Improving domain generalization in machine learning.
method Introduces a new upper bound and WBAE algorithm.
result WBAE outperforms state-of-the-art DG algorithms.