Proves rotational symmetry for Serrin-type problems in doubly connected domains.
problem Proving symmetry in Serrin-type problems for doubly connected domains.
method Employing the technique from arXiv:2109.11255 and comparing with the classical moving plane method.
result Rotational symmetry results for Serrin-type problems in doubly connected domains.
The concept of a conformal deformation has two natural extensions: quasiconformal and harmonic mappings. Both classes do not preserve the conformal type of the domain, however they cannot change it in an arbitrary way. Doubly connected domains are where one first observes nontrivial conformal invariants. Herbert Groetz…
Let N=(Ω,σ) and M=(Ω∗,ρ) be doubly connected Riemann surfaces and assume that ρ is a smooth metric with bounded Gauss curvature K and finite area. The paper establishes the existence of homeomorphisms between Ω and Ω∗ that minimize the Dirichlet energy. In the class of all homeomorphisms $f \col…
Formula for squeezing function on annuli disproves conjecture.
problem Proving squeezing function formula for annuli.
method Schottky-Klein prime function and Loewner differential equation.
result Formula for squeezing function on annuli established.
Commentary on Teichmüller's 1938 paper on conformal and quasiconformal mappings.
problem Investigations into conformal and quasiconformal mappings and their applications.
method Detailed development of conformal invariants and applications in value distribution theory.
result Insures the almost circularity of certain loci and the circularity near infinity of quasiconformal maps.
We prove the solvability of a Dirichlet problem for flat hermitian metrics on Hilbert bundles over compact Riemann surfaces with boundary. We also prove a factorization result for flat hermitian metrics on doubly connected domains.
We consider two eigenvalue problems for Laplacian on some specific doubly connected domain. In particular, we study the following two eigenvalue problems. Let B1 be an open ball in Rn and B0 be a ball contained in B1. Let ν be the outward unit normal on ∂B1. Then the first eigenvalue o…
Lipschitz mappings found between Riemann surfaces with specific properties.
problem Finding globally Lipschitz mappings between doubly connected Riemann surfaces.
method Using a result from Iwaniec, Kovalev, and Onninen, the minimizer of the energy functional is shown to be locally Lipschitz and globally Lipschitz.
result The minimizer of the energy functional is a globally Lipschitz mapping.
Let B1 be a ball of radius r1 in $S^n(\Hy^n)$, and let B0 be a smaller ball of radius r0 such that B0ˉ⊂B1. For Sn we consider r1<π. Let u be a solution of the problem $-\La u =1$ in $\Om := B_1\setminus \bar{B_0}$ vanishing on the boundary. It is shown that the associated functional…
The study finds lower bounds for the first eigenvalue of the Laplacian in planar domains with magnetic fields.
problem Finding lower bounds for the first eigenvalue of the Laplacian in planar domains with magnetic fields.
method Analyzing the spectrum of the Laplacian with magnetic Neumann boundary conditions, focusing on multiply connected domains with convex curves. Lower bounds are derived based on geometric invariants such as area, perimeter, diameter, and fluxes around inner holes.
result Sharp lower bounds for the first eigenvalue are derived for doubly connected domains and domains with an arbitrary number of holes, and a lower bound is obtained for Aharonov-Bohm operators with an arbitrary number of poles when holes shrink to points.
In this paper we establish a connection between free boundary minimal surfaces in a ball in R3 and free boundary cones arising in a one-phase problem. We prove that a doubly connected minimal surface with free boundary in a ball is a catenoid.
Our goal is to provide a novel method of representing 2D shapes, where each shape will be assigned a unique fingerprint - a computable approximation to a conformal map of the given shape to a canonical shape in 2D or 3D space (see page 22 for a few examples). In this paper, we make the first significant step in this pr…
Let A⊂R2 be a smooth doubly connected domain. We consider the Dirichlet energy E(u)=∫A∣∇u∣2, where u:A→C, and look for critical points of this energy with prescribed modulus ∣u∣=1 on ∂A and with prescribed degrees on the two connected components o…
Unified approach to conformal and modular invariants on surfaces.
problem Constructing a general family of conformal invariants on surfaces.
method Using an identification of Teichmüller space and rigged moduli space, and analytic work on harmonic functions.
result Unified conformal and modular invariants can be viewed as generalized modular invariants and functions on the rigged moduli space.
We investigate the dynamics of semigroups generated by a family of polynomial maps on the Riemann sphere such that the postcritical set in the complex plane is bounded. The Julia set of such a semigroup may not be connected in general. We show that for such a polynomial semigroup, if A and B are two connected compo…
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.
JSCN improves cross-domain recommendation by learning domain-invariant user representations.
problem Cross-domain recommendation data sparsity and domain-incompatibility issues.
method JSCN uses multi-layer spectral convolutions on different graphs to learn domain-invariant user representations and domain adaptive user mappings.
result Significant improvement in cross-domain recommendation performance (9.2% recall, 36.4% MAP improvements).
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 …
A typical domain adaptation approach is to adapt models trained on the annotated data in a source domain (e.g., sunny weather) for achieving high performance on the test data in a target domain (e.g., rainy weather). Whether the target contains a single homogeneous domain or multiple heterogeneous domains, existing wor…
Adaptive object detection method synthesizes target domain images from source domain images.
problem Large domain gap between source and target domains in object detection.
method Cross-domain CutMix with adversarial learning.
result Higher accuracy in different domain settings compared to conventional methods.