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.
168,657 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.
In conventional domain adaptation, a critical assumption is that there exists a fully labeled domain (source) that contains the same label space as another unlabeled or scarcely labeled domain (target). However, in the real world, there often exist application scenarios in which both domains are partially labeled and n…
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.
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.
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.
Domain shift is unavoidable in real-world applications of object detection. For example, in self-driving cars, the target domain consists of unconstrained road environments which cannot all possibly be observed in training data. Similarly, in surveillance applications sufficiently representative training data may be la…
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.
Appropriately evaluating the discrepancy between domains is essential for the success of unsupervised domain adaptation. In this paper, we first point out that existing discrepancy measures are less informative when complex models such as deep neural networks are used, in addition to the facts that they can be computat…
Across numerous applications, forecasting relies on numerical solvers for partial differential equations (PDEs). Although the use of deep-learning techniques has been proposed, actual applications have been restricted by the fact the training data are obtained using traditional PDE solvers. Thereby, the uses of deep-le…
In recent years, supervised machine learning models have demonstrated tremendous success in a variety of application domains. Despite the promising results, these successful models are data hungry and their performance relies heavily on the size of training data. However, in many healthcare applications it is difficult…
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.
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.
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.
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.
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…
Distance metric learning (DML) plays a crucial role in diverse machine learning algorithms and applications. When the labeled information in target domain is limited, transfer metric learning (TML) helps to learn the metric by leveraging the sufficient information from other related domains. Multi-task metric learning …
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.
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.
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 …
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…
Distribution mismatches between the data seen at training and at application time remain a major challenge in all application areas of machine learning. We study this problem in the context of machine listening (Task 1b of the DCASE 2019 Challenge). We propose a novel approach to learn domain-invariant classifiers in a…
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.
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.
Learning to automatically perceive smell is becoming increasingly important with applications in monitoring the quality of food and drinks for healthy living. In todays age of proliferation of internet of things devices, the deployment of electronic nose otherwise known as smell sensors is on the increase for a variety…
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.
Multiple marginal matching problem aims at learning mappings to match a source domain to multiple target domains and it has attracted great attention in many applications, such as multi-domain image translation. However, addressing this problem has two critical challenges: (i) Measuring the multi-marginal distance amon…
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…
For deep learning applications, the massive data development (e.g., collecting, labeling), which is an essential process in building practical applications, still incurs seriously high costs. In this work, we propose an effective data augmentation method based on generative adversarial networks (GANs), called Domain Fu…
Unsupervised domain adaptation seeks to learn an invariant and discriminative representation for an unlabeled target domain by leveraging the information of a labeled source dataset. We propose to improve the discriminative ability of the target domain representation by simultaneously learning tightly clustered target …
Study visibility properties of Kobayashi distance on unbounded domains.
problem Understanding visibility properties of Kobayashi distance on unbounded domains.
method Analyzing visibility properties in the context of Kobayashi hyperbolic domains, focusing on unbounded domains and their boundary behavior.
result Carathéodory-type extension theorem for biholomorphisms between planar domains, including infinitely-connected domains.
Develops wcPCA for better low-rank approximations in heterogeneous domains.
problem Worst-case performance of PCA in domains with distributional shifts.
method Unified framework (wcPCA) for worst-case optimization, applied to norm-minPCA and norm-maxregret.
result Empirical and theoretical worst-case optimality for low-rank approximations.