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.
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.
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.
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.
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).
Survey explores methods to adapt deep learning models across multiple labeled domains.
problem Difficulty in obtaining labeled data for deep learning models.
method Multi-source domain adaptation (MDA) to transfer knowledge from labeled to unlabeled or sparsely labeled target domains.
result MDA methods improve performance by minimizing domain shift.
New model-independent compact representations of imaginary-time data are presented in terms of the intermediate representation (IR) of analytical continuation. This is motivated by a recent numerical finding by the authors [J. Otsuki et al., arXiv:1702.03056]. We demonstrate the efficiency of the IR through continuous-…
Generates samples conditioned on labels using optimal transport.
problem Estimating conditional distributions for specific labels.
method Wasserstein geodesic generator based on optimal transport theory.
result Learned conditional distributions and optimal transport maps.
Algorithm adapts pretrained semantic segmentation models to new domains.
problem Adapting pretrained models to new, unlabeled domains without source data.
method Learn prototypical distribution in embedding space, align target domain with source domain.
result Method achieves competitive performance on benchmark tasks.
We consider a problem of optimal investment with intermediate consumption and random endowment in an incomplete semimartingale model of a financial market. We establish the key assertions of the utility maximization theory assuming that both primal and dual value functions are finite in the interiors of their domains a…
Transfer learning for causal forest
problem Estimating CATE in a causal forest
method Offset method adapted to causal context
result Bound on CATE error
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…
Algorithm improves model performance on shifted concepts without retraining.
problem Improving model performance on shifted concepts with limited source data.
method Model consolidation of intermediate internal distributions after adaptation.
result Effective improvement in model performance on shifted concepts.
In this sequel we extend the derivation of the third order helicity to magnetic fields supported on unlinked domains in 3-space. The formula is expressed in terms of generators of the deRham cohomology of the configuration space of three points in R3, which is a more practical domain from the perspective of applica…
Continuous appearance shifts such as changes in weather and lighting conditions can impact the performance of deployed machine learning models. While unsupervised domain adaptation aims to address this challenge, current approaches do not utilise the continuity of the occurring shifts. In particular, many robotics appl…
LLMs translate natural language trading intents into correct option strategies using a domain-specific language.
problem Challenges in translating natural language trading intents into correct option strategies due to the complexity of option chain data.
method Introduce Option Query Language (OQL) as a domain-specific intermediate representation to abstract option markets into high-level primitives under grammatical rules. Use LLMs as semantic parsers and validate queries by an engine.
result Significantly improves execution accuracy and logical consistency over direct baselines.
New rigidity results for manifolds with maximal symmetry rank and positive intermediate Ricci curvature.
problem Understanding the structure of manifolds with maximal symmetry rank and positive intermediate Ricci curvature.
method Recovering stronger topological rigidity results using higher intermediate Ricci curvatures and nontrivial fundamental groups.
result Stronger topological rigidity results for manifolds with maximal symmetry rank and positive intermediate Ricci curvature.
In this paper, we propose a new method called ProfWeight for transferring information from a pre-trained deep neural network that has a high test accuracy to a simpler interpretable model or a very shallow network of low complexity and a priori low test accuracy. We are motivated by applications in interpretability and…
Contradistinguisher learns to distinguish target domain without aligning source and target domains.
problem Difficulty in aligning source and target domains for domain adaptation.
method Direct approach to unsupervised domain adaptation that learns contrastive features and improves classification performance.
result Achieves state-of-the-art performance on Office-31 and VisDA-2017 datasets.
Recent reinforcement learning (RL) approaches have shown strong performance in complex domains such as Atari games, but are often highly sample inefficient. A common approach to reduce interaction time with the environment is to use reward shaping, which involves carefully designing reward functions that provide the ag…
Extends Perelman's theorem to positive intermediate curvature conditions.
problem Positive intermediate curvature conditions and their implications.
method Generalization of Perelman's gluing theorem to positive intermediate curvature conditions.
result Observer moduli space can have non-trivial higher homotopy groups.
For a pair of points in a smooth closed convex planar curve γ, its mid-line is the line containing its mid-point and the intersection point of the corresponding pair of tangent lines. It is well known that the envelope of the mid-lines (EML) is formed by the union of three affine invariants sets: Affine Envelope Sy…
The study proves that certain manifolds with boundary cannot have metrics with positive intermediate curvatures.
problem Proving the nonexistence of metrics with positive intermediate curvatures on manifolds with boundary.
method Curvature obstruction theorems for manifolds with boundary.
result Topologically nontrivial compact manifolds with boundary cannot have metrics of positive m-intermediate curvature if the boundary is m-convex. Bayesian optimization of function networks using intermediate outputs.
problem Efficiently optimizing networks of functions with significant evaluation time.
method Modeling nodes as Gaussian processes and using expected improvement acquisition function.
result Demonstrates superior performance compared to standard Bayesian optimization methods.
Improves neural network verification by merging abstract domains and Lagrangian methods.
problem Prove provable bounds for neural network outputs given input ranges.
method Uses zonotopes within a Lagrangian decomposition to verify deep neural networks.
result Yields bounds that improve upon existing techniques in both time and tightness.
We use a local argument to prove if an r-dimensional torus acts isometrically and effectively on a connected n-dimensional manifold which has positive kth-intermediate Ricci curvature at some point, then r≤⌊2n+k⌋. This symmetry rank bound generalizes those established by Gr…
Modern automatic speech recognition (ASR) systems need to be robust under acoustic variability arising from environmental, speaker, channel, and recording conditions. Ensuring such robustness to variability is a challenge in modern day neural network-based ASR systems, especially when all types of variability are not s…
The rate at which medical questions are asked online far exceeds the capacity of qualified people to answer them, and many of these questions are not unique. Identifying same-question pairs could enable questions to be answered more effectively. While many research efforts have focused on the problem of general questio…
The deep layers of modern neural networks extract a rather rich set of features as an input propagates through the network. This paper sets out to harvest these rich intermediate representations for quantization with minimal accuracy loss while significantly reducing the memory footprint and compute intensity of the DN…
Study on rigidity with non-negative intermediate curvature on low-dimensional manifolds.
problem Extending non-existence theorem of positive scalar curvature to product manifolds.
method Introduced intermediate curvature and studied rigidity conditions.
result Rigidity when intermediate curvature is non-negative in low dimensions.
Log-Sobolev inequality proven for submanifolds in specific types of manifolds.
problem Proving Log-Sobolev inequality for submanifolds in asymptotic non-negative intermediate Ricci curvature manifolds.
method Extending previous results, proving inequality for submanifolds in specific types of manifolds.
result Sharp Log-Sobolev inequality proven for submanifolds in complete non-compact Riemannian manifolds with asymptotic non-negative intermediate Ricci curvature and Euclidean volume growth.
Preserves positive intermediate curvature on manifolds.
problem Obstructs positive intermediate curvature on partial tori.
method Shows smooth interpolation of metrics with positive intermediate curvature.
result Proves non-existence of certain manifolds with positive intermediate curvature.
Optimizes transport on submanifolds for curvature inequalities.
problem Proving Michael-Simon-Sobolev inequalities in manifolds with intermediate Ricci curvature bounds.
method Generalizes optimal transport theory to submanifolds and applies to curvature inequalities.
result Proves a variant of the Michael-Simon-Sobolev inequality in manifolds with nonnegative intermediate Ricci curvatures.
Mantis improves time series classification using a transformer model trained on synthetic data.
problem Insufficient application of foundation models to time series classification.
method Pre-trained transformer model on synthetic data, enhanced test-time methodology.
result Mantis achieves state-of-the-art performance across diverse datasets.
Extends metric properties over surgeries to higher codimensions.
problem Extending metrics of positive scalar curvature over surgeries in higher codimensions.
method Generalizes Gromov-Lawson, Schoen-Yau, and Walsh's construction to (p,n)-intermediate scalar curvature. result Shows infinitely many path components for certain metrics on (4n−1)-manifolds. Knowledge distillation (KD) is a popular method for reducing the computational overhead of deep network inference, in which the output of a teacher model is used to train a smaller, faster student model. Hint training (i.e., FitNets) extends KD by regressing a student model's intermediate representation to a teacher mo…
The study connects manifold topology to metrics with positive intermediate curvature.
problem Understanding the relationship between manifold topology and metrics with positive intermediate curvature.
method Formulated a conjecture and proved it for specific dimensions and conditions.
result Closed, aspherical 6-manifolds cannot admit metrics with positive 4-intermediate curvature.
Many AI problems, in robotics and other domains, are goal-directed, essentially seeking a trajectory leading to some goal state. In such problems, the way we choose to represent a trajectory underlies algorithms for trajectory prediction and optimization. Interestingly, most all prior work in imitation and reinforcemen…
Study on spaces of metrics with intermediate curvature bounds.
problem Understanding spaces of metrics with lower bounds on intermediate curvatures.
method Analyzing spaces of Riemannian metrics with specific curvature bounds on high-dimensional Spin-manifolds.
result Spaces of metrics with positive p-curvature and k-positive Ricci curvature have non-trivial homotopy groups.
Paper introduces a new curriculum generation method for reinforcement learning.
problem Improving reinforcement learning performance and speed through curriculum learning.
method The paper proposes a novel curriculum generation paradigm based on progression and mapping functions.
result Empirical results show the new approach outperforms state-of-the-art algorithms.
Study of Calabi-Yau manifold degenerations near complex structure limits.
problem Understanding polarized degenerations of Calabi-Yau manifolds.
method Improvement of metric convergence results on generic regions.
result Metric convergence for collapsing Ricci-flat Kähler metrics on generic regions.
Proves metrics with positive intermediate Ricci curvature on complex manifolds.
problem Establishing metrics with positive intermediate Ricci curvature on complex manifolds.
method Canonical variation and surgery techniques.
result Existence of metrics with positive intermediate Ricci curvature on various examples.
Mix-up domain adaptation improves dynamic RUL predictions across various conditions.
problem Dynamic RUL predictions under non-i.i.d conditions.
method Three-staged mechanism with mix-up strategy for source and target domains alignment, self-supervised learning.
result MDAN outperforms existing methods in 12 out of 12 cases for dynamic RUL predictions.
We present an adaptive online gradient descent algorithm to solve online convex optimization problems with long-term constraints , which are constraints that need to be satisfied when accumulated over a finite number of rounds T , but can be violated in intermediate rounds. For some user-defined trade-off parameter β…
Study finds metrics with positive intermediate Ricci curvature on specific low-dimensional manifolds.
problem Existence of invariant metrics with positive intermediate Ricci curvature on low-dimensional cohomogeneity one manifolds.
method Construction of invariant metrics with positive intermediate Ricci curvature on specific manifolds.
result Invariant metrics with positive 4th-intermediate Ricci curvature exist but not for 3rd-intermediate Ricci curvature on certain manifolds.
The study allows for connected sums in manifolds with positive intermediate Ricci curvature.
problem Performing connected sums in manifolds with positive intermediate Ricci curvature.
method Introducing and utilizing k-core metrics to show the possibility of connected sums. result Connected sums are possible under certain conditions involving k-core metrics. New method learns flows between multiple distributions efficiently.
problem Learning dynamic transport maps between multiple empirical distributions.
method Combining flow matching and dynamic optimal transport with potential terms.
result OTP-FM achieves state-of-the-art performance on various datasets.
Sharp dimension constraints for positive intermediate curvature metrics are established.
problem Proving sharp dimension constraints for metrics with positive intermediate curvature.
method Constructing counterexamples and extending rigidity results.
result Sharp dimension constraints for positive intermediate curvature metrics are established.