A basic assumption of statistical learning theory is that train and test data are drawn from the same underlying distribution. Unfortunately, this assumption doesn't hold in many applications. Instead, ample labeled data might exist in a particular `source' domain while inference is needed in another, `target' domain. …
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
169,051 papers · 148 categories
Trend · papers per month
48 results for “Application domains”
Paper proposes CCVAE for generalized zero-shot domain adaptation.
problem Adapting to unseen classes in target domain with limited labeled data.
method Coupled Conditional Variational Autoencoder (CCVAE).
result CCVAE generates synthetic target domain features for unseen classes.
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.
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.
This thesis studies domain adaptation under minimal distribution similarity assumptions using moments.
problem Learning from samples with distributions different from training samples.
method Uses minimal similarity assumptions modeled by moments.
result Establishes learning bounds and algorithms for domain adaptation.
Method transfers knowledge between partially labeled domains to classify all samples.
problem Weakly supervised open-set domain adaptation between partially labeled domains.
method Collaborative Distribution Alignment (CDA) method for bilaterally knowledge transfer and outlier identification.
result Achieves state-of-the-art performance on Office benchmark and person reidentification.
In this paper, finite type domains with hyperbolic orbit accumulation points are studied. We prove, in case of , it has to be a (global) pseudoconvex domain, after an assumption of boundary regularity. Moreover, one of the applications will realize the classification of domains within this class, precisel…
Enhances source domain knowledge with target data for transfer learning.
problem Limited data in target domains and rigid model assumptions in transfer learning.
method Transfer learning through Enhanced Sufficient Representation (TESR).
result TESR enhances source domain knowledge with target data, improving transfer learning performance.
Proposes PHD to measure domain discrepancy for complex models.
problem Insufficient domain discrepancy measures for complex models.
method Introduces PHD, a novel discrepancy measure for complex models.
result PHD is computationally efficient and applicable to multi-class classification.
SIG model identifies invariant variables for MSDA with fewer domain constraints.
problem Challenges in enforcing minimal changes across domains for MSDA.
method Subspace identification theory and variational inference.
result SIG model outperforms existing techniques on various benchmark datasets.
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.
Large-scale labeled training datasets have enabled deep neural networks to excel on a wide range of benchmark vision tasks. However, in many applications it is prohibitively expensive or time-consuming to obtain large quantities of labeled data. To cope with limited labeled training data, many have attempted to directl…
Paper introduces a novel map learning algorithm for domain translation and adaptation.
problem Learning a map between related data spaces that can be applied to out-of-sample data and satisfies application-specific constraints.
method Utilizes normalizing flows to parameterize a map that minimizes a probability distance and application-specific regularizers, solving a modified optimal transport problem.
result The proposed method (parOT) outperforms existing optimal transport approaches in domain adaptation and translation tasks.
Paper tackles domain adaptation in object detection, improving accuracy.
problem Real-world object detection faces domain shift issues.
method Formulates domain adaptation as noisy label training; uses noisy bounding boxes from source domain.
result Significantly improves object detection accuracy on various domain adaptation scenarios.
Deep learning improves air pollution forecasting and monitoring.
problem Limited applicability of deep learning in air pollution forecasting due to traditional PDE solvers.
method Combines deep-learning and domain-decomposition techniques for air pollution monitoring and forecasting.
result Reduces run-time by two orders of magnitude and extends model deployment beyond trained domains.
Solves relative isoperimetric problem on polygonal domains, focusing on corners.
problem Relative isoperimetric problem on polygonal domains in .
method Developed techniques for polygonal domains, with special attention to corners.
result Solved the relative isoperimetric problem for a square with a square corner removed.
Survey of deep learning methods for anomaly detection.
problem Detecting anomalies in various applications.
method Review of deep learning techniques for anomaly detection.
result Comprehensive overview of deep learning methods for anomaly detection.
End-to-end DA method for domain-invariant CNNs using parallel audio recordings.
problem Distribution mismatches between training and application data in machine listening.
method Enforcing equal hidden layer representations for domain-parallel samples.
result Learn domain-invariant classifiers without requiring classification labels.
Gradual domain adaptation improves model transfer between domains with intermediate training.
problem Challenges in unsupervised domain adaptation when distribution shifts are large.
method Gradual self-training using intermediate domains along the Wasserstein geodesic.
result GOAT framework generates intermediate domains for improved adaptation.
In this paper we analyze the problem of the geodesic connectedness of subsets of Riemannian manifolds. By using variational methods, the geodesic connectedness of open domains (whose boundaries can be not differentiable and not convex) of a smooth Riemannian manifold is proved. In some cases also the convexity of the d…
In this work, we study the problem of learning a single model for multiple domains. Unlike the conventional machine learning scenario where each domain can have the corresponding model, multiple domains (i.e., applications/users) may share the same machine learning model due to maintenance loads in cloud computing serv…
Paper develops a new method to improve model calibration under distribution shifts.
problem Challenges in uncertainty quantification with different training and test distributions.
method Develops multi-domain temperature scaling to handle distribution shifts.
result Outperforms existing methods on in-distribution and out-of-distribution test sets.
TML uses knowledge from related domains to improve metric learning in target domain.
problem Insufficient label information in real-world applications.
method Leveraging knowledge from related domains to improve metric learning in target domain.
result TML can improve metric learning performance in target domain.
Paper develops Riemannian geometry for SPSD matrices with DA applications.
problem Riemannian geometry of SPSD matrices for DA.
method Closed-form expressions, approximations of geodesic path, PT, canonical representation.
result Proposes an algorithm for DA with improved performance.
New upper bound for Neumann Laplacian eigenvalues on convex domains.
problem Bounding Neumann eigenvalues on convex domains.
method Deriving a new upper bound for eigenvalues.
result Universal inequalities for Neumann eigenvalues derived from the upper bound.
A new hybrid method improves transfer learning performance.
problem Data scarcity in healthcare applications.
method Probabilistic weighting strategy to fuse source and target domain information.
result Our method outperforms existing instance-based transfer learning approaches.
Optimal inequality for free boundary hypersurfaces in convex domains.
problem Proving an optimal Heintze-Karcher inequality for free boundary hypersurfaces.
method Analyzing anisotropic free boundary hypersurfaces in convex domains.
result Optimal Heintze-Karcher-type inequality achieved for anisotropic free boundary Wulff shapes.
Stream deinterleaving is an important problem with various applications in the cybersecurity domain. In this paper, we consider the specific problem of deinterleaving DNS data streams using machine-learning techniques, with the objective of automating the extraction of malware domain sequences. We first develop a gener…
We apply Gromov's ham sandwich method to get (1) domain monotonicity (up to a multiplicative constant factor); (2) reverse domain monotonicity (up to a multiplicative constant factor); and (3) universal inequalities for Neumann eigenvalues of the Laplacian on bounded convex domains in a Euclidean space.
Shapley values explain financial language models, aligning with domain knowledge.
problem Lack of explainability in financial applications of large language models.
method Shapley value analysis for financial textual data.
result Shapley values provide consistent explanations with financial reasoning.
This paper proposes a method to compress and adapt CNNs for real-world applications.
problem Differences in data distributions and high computational costs limit CNN adoption.
method Joint optimization of CNNs for unsupervised domain adaptation and knowledge distillation.
result The proposed method achieves the highest accuracy with comparable or lower time complexity.
Domain-Adversarial Neural Networks improve fault diagnosis models across different machines.
problem Improving fault diagnosis models on new machines with limited labeled data.
method Domain-Adversarial Neural Networks (DANN) and other methods for domain adaptation.
result Unified experimental protocol for fair comparison of domain adaptation methods.
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.
Develops a method to learn metrics across multiple domains using heterogeneous transfer learning.
problem Limited labeled data in target domain and heterogeneous data across multiple domains.
method HMTML framework that learns metrics and transformations across multiple domains, maximizing high-order covariance in a common subspace.
result Effective feature transformations and metrics learned across multiple domains, validated by extensive experiments.
Study Kähler manifolds on tube domains, proving curvature uniqueness and applications to optimal transport.
problem Proving uniqueness of Kähler manifolds with specific curvature properties.
method Analyzing Kähler manifolds on tube domains with symmetry, proving curvature properties and isometries.
result Proves uniqueness of Kähler manifolds with non-negative curvature under certain conditions.
Establishes a lower bound for Kähler hyperbolicity modulus in hyperconvex domains and bounded strongly pseudoconvex domains.
problem Kähler hyperbolicity modulus for simply-connected Kähler hyperbolic manifolds
method Computes the Kähler hyperbolicity modulus for bounded symmetric domains
result Establishes a lower bound for the Kähler hyperbolicity modulus in terms of the boundary behavior of the gradient length of a plurisubharmonic function
Uniformizes klt pairs using bounded symmetric domains.
problem Characterizing klt pairs uniformizable by bounded symmetric domains.
method Determines conditions for uniformization using Miyaoka-Yau-type inequalities.
result Characterizations of orbifold quotients of polydisc and classical bounded symmetric domains.
Benchmark for UDA in time series classification.
problem Lack of benchmarks for unsupervised domain adaptation in time series.
method Introduces a comprehensive benchmark with new datasets and state-of-the-art neural network backbones.
result Insights into strengths and limitations of UDA methods for time series data.
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.
Domain-general semantic parsing is a long-standing goal in natural language processing, where the semantic parser is capable of robustly parsing sentences from domains outside of which it was trained. Current approaches largely rely on additional supervision from new domains in order to generalize to those domains. We …
Domain Fusion uses GANs to augment data for low-volume target datasets.
problem High costs in data development for deep learning applications.
method Multi-domain learning GANs to generate new samples.
result Domain Fusion achieves better classification accuracy with less data.
New algorithm enhances generative modeling for bounded domains.
problem Ad-hoc thresholding techniques for boundary enforcement in diffusion models.
method Reflected Schrödinger Bridge algorithm for entropy-regularized optimal transport.
result Generative modeling in diverse bounded domains with optimal transport properties.
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…
Complementary Domain Adaptation and Generalization for Unsupervised Continual Domain Shift Learningcs.LG
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.
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.
Improves domain adaptation by clustering target representations.
problem Learning invariant and discriminative representations for unlabeled target domains.
method Simultaneously learns tightly clustered target representations and assigns each cluster to a unique class from the source.
result Achieves state-of-the-art performance in balanced, imbalanced, and partial domain adaptation.
Proposes DFDG for robust domain generalization without source domain labels.
problem Robustness of deep learning models in real-world applications where train and test distributions differ.
method Model-agnostic, class-aware alignment of class relationships through saliency maps.
result Competitive performance on time series sensor and image classification datasets.
We provide new bounds on a flux integral over the portion of the boundary of one regular domain contained inside a second regular domain, based on properties of the second domain rather than the first one. This bound is amenable to numerical computation of a flux through the boundary of a domain, for example, when ther…