New method detects non-product domains using squeezing function.
problem Detecting non-product bounded pseudoconvex domains.
method New application of squeezing function and optimal estimates.
result Identifies new family of holomorphic homogeneous regular domains.
In this paper, for an even dimensional compact manifold with boundary which has the non-product metric near the boundary, we use the noncommutative residue to define a conformal invariant pair. For a 4-dimensional manifold, we compute this conformal invariant pair under some conditions and point out the way of computat…
We consider ribbon R4's, that is, smooth open 4-manifolds, homeomorphic to R4 and associated to h-cobordisms between closed 4-manifolds. We show that any generalized ribbon R4 associated to a sequence of h-cobordisms between non-diffeomorphic 4-manifolds is exotic. Notion of a positive ribbon R4 is defi…
No non-product Hessian rank 1 affine homogeneous hypersurfaces exist in dimensions 5 and above.
problem Identifying non-product Hessian rank 1 affine homogeneous hypersurfaces in higher dimensions.
method Developed a normal form for hypersurfaces under the affine group, up to order ≤ n+5, in any dimension n ≥ 2.
result Non-existence of non-product Hessian rank 1 affine homogeneous hypersurfaces in dimensions 5 and above.
We show that if a closed atoroidal 3-manifold M contains a genuine lamination, then it is group negatively curved in the sense of Gromov. Specifically, we exploit the structure of the non-product complementary regions of the genuine lamination and then apply the first author's Ubiquity Theorem to show that M satisfies …
We employ cut and paste contact topological techniques to classify some tight contact structures on the closed, oriented genus-2 surface times the interval. A boundary condition is specified so that the Euler class of the of the contact structure vanishes when evaluated on each boundary component. We prove that there e…
This work extends entropic optimal transport to non-product reference couplings, focusing on Gaussian cases.
problem Finding a diffuse coupling between two measures with non-product reference couplings.
method Reduction of the entropic optimal transport problem to a matrix optimization problem.
result Complete description of the solution for non-product reference couplings, including primal and dual variables.
Proves convergence of mean curvature flow on cylinders with unique continuation.
problem Understanding the convergence and uniqueness of mean curvature flow on cylindrical surfaces.
method Proves convergence and provides unique continuation results for mean curvature flow on cylinders.
result Proves that rescaled mean curvature flow on cylinders converging super-exponentially must coincide with the cylinder itself.
Study shows unique Einstein metrics on SU2n+1 and related spaces.
problem Rigidity of Einstein metrics on SU2n+1 and related spaces. method Proof of rigidity using infinitesimal deformations and connections to Ricci flow.
result Bi-invariant Einstein metric on SU2n+1 is isolated in the moduli space of Einstein metrics. Least symmetry breaking principle explains SGD's local minima in shallow ReLU networks.
problem Understanding the structure of local minima in two-layer ReLU networks.
method Analyzing the squared loss optimization problem for ReLU networks with Gaussian inputs and applying the principle of least symmetry breaking.
result The principle of least symmetry breaking explains the structure of spurious local minima detected by SGD.
We consider a generalized APS boundary problem for a G-invariant Dirac-type operator, which is not of product type near the boundary. We establish a delocalized version (a so-called Kirillov formula) of the equivariant index theorem for this operator. We obtain more explicit formulas for different geometric Dirac-type …
New method constructs multi-monopoles on mapping tori.
problem Understanding wall-crossing in multi-monopole counts.
method Adiabatic limit theorem to construct multi-monopoles.
result First explicit constructions of multi-monopoles in various chambers.
Surrogate-based analysis of interactions via local effect smooths
problem Detecting and characterizing feature interactions in machine learning models
method Surrogate-based analysis using generalized additive models
result Empirical validation of effectiveness for pairwise interactions
Unrolled networks learn optimal Bayesian inference for unknown priors.
problem Optimizing Bayesian inference when the prior is unknown.
method Unrolling neural networks to simulate iterations of inference algorithms.
result Unrolled networks approximate convergence to optimal denoisers for product priors.
High-dimensional curved diffusions show abrupt convergence at a critical time.
problem Understanding abrupt convergence in high-dimensional curved diffusions.
method Functional inequalities and spectral rigidity.
result Abrupt convergence (cutoff) occurs in high dimensions, linked to spectral rigidity.
Extremal Kahler metrics and Sasaki-Einstein metrics characterized via coercive energy.
problem Characterizing extremal Kahler and Sasaki metrics using energy coercivity.
method Maximal complex torus, coercive weighted Mabuchi energy, K-polystability.
result Coercive weighted Mabuchi energy implies strict positivity of Donaldson-Futaki invariant and existence of extremal metrics.
The study classifies Hessian rank 1 hypersurfaces in dimensions 2, 3, and 4.
problem Classifying Hessian rank 1 affinely homogeneous hypersurfaces in specific dimensions.
method Power Series Method of Equivalence, infinitesimal calculations.
result Identified all non-product constant Hessian rank 1 affinely homogeneous hypersurfaces in dimensions 2, 3, and 4.
Smoothed analysis shows that many classes become learnable from positive-only samples.
problem Learning from positive-only samples is challenging due to negative results in worst-case settings.
method Smoothed analysis of positive-only learning, assuming samples from a reference distribution smooth with respect to the true distribution.
result All VC classes become learnable in the smoothed model with O(VC/ε2) positive samples for ε classification error. Method generates intermediate domains to align source and target domains.
problem Challenges of domain adaptation with significant domain divergence.
method Progressive domain augmentation via domain interpolation and multiple subspace alignment.
result Achieves state-of-the-art performance on multiple domain adaptation tasks.
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.
CoDAG combines domain adaptation and generalization for unsupervised continual domain shift learning.
problem Acquiring knowledge in unsupervised continual domain shift learning.
method Complementary Domain Adaptation and Generalization (CoDAG) framework.
result CoDAG outperforms state-of-the-art models in all datasets and evaluation metrics.
DCASE 2022 Task 2 tackles domain shifts in ASD for machine condition monitoring.
problem Domain shifts change acoustic characteristics, affecting ASD performance.
method Domain generalization techniques to detect anomalies across unknown domains.
result Two types of domain generalization techniques were identified and analyzed.
Extends polydisk theorem to Hartogs domains over symmetric domains.
problem Rigidity phenomena in Riemannian manifolds.
method Extension of polydisk theorem to Hartogs domains over arbitrary symmetric domains.
result Dual of a Hartogs domain over a bounded symmetric domain admits no totally geodesic immersion into any compact Riemannian manifold.
Adaptive multi-domain learning reduces parameter count for efficient deep learning.
problem Different domains have varying complexity, leading to inefficient model training.
method Proposes adaptive parameterization to reduce model complexity without sacrificing performance.
result Efficient multi-domain learning solutions with far fewer parameters.
Recently multi-domain recommender systems have received much attention from researchers because they can solve cold-start problem as well as support for cross-selling. However, when applying into multi-domain items, although algorithms specifically addressing a single domain have many difficulties in capturing the spec…
Proposes novel losses for fine-grained categorical domain adaptation.
problem Fine-grained alignment of categories across domains in unsupervised domain adaptation.
method Joint category-domain classifier with adversarial training losses for both domain and category levels, and vicinal domain adaptation.
result Achieves state-of-the-art performance on benchmark datasets.
Improves unsupervised domain adaptation by mixing source and target domains.
problem Improves unsupervised domain adaptation by mixing source and target domains.
method Enforces training constraints across domains using mixup formulation and feature-level consistency regularizer.
result Significantly improves state-of-the-art performance on image classification and human activity recognition tasks.
We address the problem of domain generalization where a decision function is learned from the data of several related domains, and the goal is to apply it on an unseen domain successfully. It is assumed that there is plenty of labeled data available in source domains (also called as training domain), but no labeled dat…
MetFA aligns source and target domains for cross-device image classification.
problem Learning discriminative class boundaries across different domains.
method Distance metric guided feature alignment (MetFA) for domain-invariant and discriminative feature extraction.
result MetFA outperforms state-of-the-art methods in cross-device image classification.
In this paper, we propose a simple model referred as Contradistinguisher (CTDR) for unsupervised domain adaptation whose objective is to jointly learn to contradistinguish on unlabeled target domain in a fully unsupervised manner along with prior knowledge acquired by supervised learning on an entirely different domain…
CSD learns a common component for domain generalization, outperforming existing methods.
problem Training models to generalize across unseen domains.
method CSD decomposes the model into a common and specific component, discarding the latter.
result CSD outperforms state-of-the-art domain generalization methods.
Method learns domain-specific representations without supervision.
problem Domain generalization without labeled data.
method Hierarchical variational autoencoder approach.
result Model generalizes to unseen domains without domain supervision.
A new method uses normalizing flows for gradual domain adaptation.
problem Difficulty in domain adaptation when source and target domains have a large gap.
method Proposes using normalizing flows to learn a transformation from target to Gaussian mixture distribution.
result Improves classification performance and mitigates the problem of gradual self-training failure.
We propose a method to infer domain-specific models such as classifiers for unseen domains, from which no data are given in the training phase, without domain semantic descriptors. When training and test distributions are different, standard supervised learning methods perform poorly. Zero-shot domain adaptation attemp…
Study shows how many domains are needed for generalization, using a new measure called domain shattering dimension.
problem How many domains are needed for domain generalization?
method Introduced a new combinatorial measure called the domain shattering dimension to model domain sample complexity.
result Established a tight quantitative relationship between domain shattering dimension and classic VC dimension.
TAROT enhances robustness and domain adaptability with domain-invariant features.
problem Developing models robust to adversarial attacks across diverse domains.
method Derives a new generalization bound and proposes TAROT algorithm.
result TAROT outperforms state-of-the-art methods in accuracy and robustness.
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.
We present CROSSGRAD, a method to use multi-domain training data to learn a classifier that generalizes to new domains. CROSSGRAD does not need an adaptation phase via labeled or unlabeled data, or domain features in the new domain. Most existing domain adaptation methods attempt to erase domain signals using technique…
We define self-adjoint extensions of the Hodge Laplacian on Lipschitz domains in Riemannian manifolds, corresponding to either the absolute or the relative boundary condition, and examine regularity properties of these operators' domains and form domains. We obtain results valid for general Lipschitz domains, and stron…
Graph-Relational Domain Adaptation (GRDA) adapts domains based on their graph structure.
problem Uniform alignment of domains ignores topological structures.
method Uses a domain graph to encode adjacency and a novel graph discriminator.
result Empirically shows improved generalization and domain information incorporation.
A cost-effective framework for gradual domain adaptation using multifidelity.
problem Degrading prediction performance due to large domain distance.
method Combines multifidelity and active domain adaptation.
result Improves prediction performance with reduced sample cost.
Proposes first method for continuously indexed domain adaptation.
problem Challenges of transferring knowledge between continuously indexed domains.
method Combines adversarial adaptation with a novel discriminator.
result Outperforms state-of-the-art methods on synthetic and real-world datasets.
Dynamic residual adapters improve performance across multiple latent domains without domain labels.
problem Overfitting to large domains and ignoring smaller ones in multi-domain learning.
method Dynamic residual adapters and augmentation strategies inspired by style transfer.
result Dynamic residual adapters significantly outperform standard models on multiple latent domains.
New method removes pseudo-label bias for unsupervised domain adaptation.
problem Class imbalance and distribution shift between domains.
method Implicit class-conditioned domain alignment without explicit pseudo-label optimization.
result Effective in handling within-domain class imbalance and between-domain class distribution shift.
Paper proposes MDAT to stabilize domain alignment in label-scarce settings.
problem Stable and comprehensive domain alignment in label-scarce settings.
method Max-margin Domain-Adversarial Training (MDAT) with Adversarial Reconstruction Network (ARN).
result MDAT stabilizes gradient reversing and achieves strong robustness to hyper-parameters.
Paper tackles robust domain adaptation without target domain data.
problem Learning domain invariant representations without target domain data.
method Integrates deep autoencoder and causal structure learning into a unified model.
result CAE learns causal representations using only source domain data.
Interventional domain adaptation improves feature transferability by removing spurious correlations.
problem Improper feature transferability due to spurious correlations in domain adaptation.
method Intervention strategy using unlabeled target data to generate counterfactual features and train discriminability invariance.
result Consistent performance improvements over state-of-the-art approaches in various domain adaptation tasks.
Supervised learning algorithms trained on medical images will often fail to generalize across changes in acquisition parameters. Recent work in domain adaptation addresses this challenge and successfully leverages labeled data in a source domain to perform well on an unlabeled target domain. Inspired by recent work in …