DANE adapts network embeddings across multiple domains.
problem Learning embeddings for multiple networks without transferability.
method Graph Convolutional Network with adversarial learning.
result DANE achieves superior performance in cross-network domain adaptation.
Two new methods improve graph embedding without needing a complete graph structure.
problem Graph autoencoders' performance depends on the adjacency matrix quality.
method BAGE and VBAGE: unsupervised graph embedding via adaptive graph learning.
result The methods expand GAEs' applicability to datasets without graph structure.
This paper improves domain adaptation methods using graph embedding.
problem Alleviating distribution gaps between different data domains.
method Formulate domain adaptation as graph embedding, analyze loss functions, propose rectified evaluation protocol.
result Improved benchmarks on standard datasets demonstrate the effectiveness of the proposed methods.
AVDA transfers knowledge from source to target domains using embeddings.
problem Transferring knowledge from a source domain to a target domain with limited labeled data.
method Adversarial Variational Domain Adaptation (AVDA) with deep embeddings and Gaussian Mixture Model.
result AVDA outperforms previous methods in semi-supervised few-shot domain adaptation.
SA-REMBO adapts to nonstationary high-dimensional optimization.
problem Bayesian Optimization in high-dimensional spaces is limited by the curse of dimensionality and rigidity of global assumptions.
method SA-REMBO uses multiple random Gaussian embeddings and an index variable to adaptively select the best embedding for the optimization problem.
result SA-REMBO outperforms traditional REMBO and other low-rank BO methods across synthetic and real-world benchmarks.
Improved embeddings by topic-sensitive attention on large corpora.
problem Capturing sense of words in limited corpora using pretrained embeddings.
method Topic-sensitive attention on large topic-rich corpora to correct sense drift in pretrained embeddings.
result Limited corpus augmentation is more effective than adapting pretrained embeddings.
This work examines how embedding complexity impacts domain adaptation.
problem Improving generalization to an unlabeled target domain.
method Theoretical and empirical study of embedding complexity in multilayer neural networks.
result Developed a strategy to mitigate embedding complexity sensitivity and achieve performance on par with best tradeoffs.
Proposes a graph embedding framework for domain adaptation.
problem Improving performance on small datasets using related large datasets.
method Formulates domain adaptation as a graph embedding problem, learning a feature transformation end-to-end.
result Simple instantiation leads to state-of-the-art performance on benchmarks.
Global anchor method detects language shifts and domain adaptation.
problem Detecting corpus-level language shifts and domain adaptation.
method Global anchor method for comparing word embeddings.
result Global anchor method is superior to alignment method in applicability and implementation.
EGORSE optimizes high-dimensional problems using random and supervised embeddings.
problem Efficiently solving computationally expensive high-dimensional optimization problems.
method EGORSE combines random and supervised linear embeddings for adaptive optimization.
result EGORSE outperforms state-of-the-art methods in high-dimensional optimization.
LLM embeddings improve adaptation to tabular Y∣X-shifts with few labeled examples.
problem Improving robustness to Y∣X-shifts in tabular data. method Serializing tabular data to LLM embeddings and fine-tuning for adaptation.
result LLM embeddings can be adapted to target domains with minimal labeled data.
NMIXX fine-tunes embeddings for finance, outperforming general models in Korean.
problem Financial embeddings struggle in low-resource languages like Korean.
method Fine-tuned with 18.8K triplets, hard negatives, and translations.
result NMIXX achieves gains of +0.10 on English FinSTS and +0.22 on KorFinSTS.
Geometric approach for unsupervised word embedding alignment.
problem Learning alignment between word embeddings of source and target languages.
method Formulates alignment as domain adaptation on the manifold of doubly stochastic matrices, employing Riemannian conjugate gradient algorithm.
result Empirically outperforms state-of-the-art methods on bilingual lexicon induction tasks.
CILF learns adaptive embeddings for class-incremental learning with novel class detection and model update.
problem Handling unknown classes and model update in streaming data with new classes.
method CILF uses decoupled prototype based loss for intra-class and inter-class structure improvement, and a learnable curriculum clustering operator for adaptive embedding.
result CILF effectively detects multiple novel classes and mitigates embedding confusion, while updating the model without catastrophic forgetting.
Prob2Vec embeds problems for adaptive tutoring, achieving high similarity accuracy.
problem Retrieve problems with similar mathematical concepts for adaptive tutoring.
method Hierarchical problem embedding algorithm (Prob2Vec) combining abstraction and embedding steps.
result 96.88% accuracy on problem similarity test, significantly outperforming state-of-the-art sentence embedding methods.
NLE embeds labels for domain adaptation with neural networks.
problem Adapting deep neural networks with unpaired source and target domain data.
method Distill source-domain knowledge into l-vectors, soft targets for adaptation.
result 14.1% relative word error rate reduction over direct re-training.
Meta-learning approach for adaptive TTS with few data.
problem Adapting TTS systems to new speakers with minimal data.
method Meta-learning with shared WaveNet core and independent speaker embeddings, using three training strategies.
result Successful adaptation of multi-speaker neural network to new speakers with minimal data.
Pedagogical approaches help interpret embedding models in knowledge bases.
problem Hard interpretation of embedding models in knowledge bases.
method Adapt pedagogical approaches from neural networks literature to interpret embedding models.
result Extracted weighted Horn rules from embedding models for interpretation.
This paper tackles UDA by learning domain-invariant embeddings using distribution alignment and pseudo-labels.
problem Unsupervised domain adaptation between two visual domains.
method Shared deep encoder, Sliced-Wasserstein Distance, deep classifier, pseudo-labels for class alignment.
result Effective solution for training deep classification networks on source domain to generalize to target domain.
New learning rates for embeddings in RKHSs, even when the target is not Hilbert-Schmidt.
problem Applying conditional mean embeddings to complex ML/RL settings with infinite-dimensional RKHSs.
method Developed novel learning rates using interpolation theory for RKHSs, derived explicit adaptive rates for sample estimator.
result Achieved uniform convergence rates in the output RKHS for certain parameter regimes.
New algorithm reduces sketching dimension to effective problem size.
problem Solving L2-regularized least-squares problems efficiently.
method Randomized algorithm using Gaussian and SRHT embeddings.
result Preserves convergence guarantees with reduced embedding dimension.
AGE improves graph embedding by smoothing features and iteratively enhancing node embeddings.
problem Challenges in attributed graph embedding, especially in preserving optimal low-pass characteristics and robustness.
method AGE, a novel framework combining Laplacian smoothing and adaptive encoding, addresses these issues.
result AGE consistently outperforms state-of-the-art methods on node clustering and link prediction tasks.
A new node embedding method that adapts to graph structure.
problem Scalable node embedding for large graphs.
method Adaptive node similarity matrix for multilength paths.
result Superior performance in node classification, link prediction, and clustering.
Method trains shared embedding to align inputs and outputs for domain adaptation.
problem Unsupervised domain adaptation between different data domains.
method Regularized conditional alignment objective function and adversarial regularization.
result Improves classifier performance on unseen domain.
Adaptive regularization prevents overfitting in large-scale sparse feature models.
problem Overfitting in models with large-scale sparse categorical features.
method Adaptive regularization of embedding layers' norm budget.
result Improves model performance within a single epoch and prevents multi-epoch performance degradation.
Proposes a method to align and differentiate feature clusters for unsupervised domain adaptation.
problem Difficulty in obtaining labeled data for domain adaptation.
method Label propagation and cycle consistency to align feature clusters.
result Successfully formed aligned and discriminative clusters for better domain adaptation.
Proposes DIAL-GNN for joint graph structure and embedding learning.
problem Joint learning of graph structure and embeddings.
method Adapted graph regularization, iterative method for graph structure learning.
result Consistently outperforms state-of-the-art baselines in downstream tasks and computational time.
COLoKe adapts Koopman embeddings online, reducing overfitting and improving long-term predictions.
problem Online adaptation of Koopman embeddings to avoid overfitting and maintain long-term predictive accuracy.
method Combines deep feature learning with multistep prediction consistency in a lifted space, using a conformal-style mechanism for selective updates.
result Empirically effective in reducing overfitting and maintaining long-term predictive accuracy.
Meta-SAGE improves deep RL scalability for CO tasks by adapting pre-trained models to larger-scale problems.
problem Improving scalability of deep reinforcement learning models for combinatorial optimization tasks.
method Meta-SAGE combines a scale meta-learner and scheduled adaptation with guided exploration to adjust model parameters for larger-scale problems.
result Meta-SAGE outperforms previous methods and significantly improves scalability in CO tasks.
A new method for unsupervised domain adaptation using manifold learning.
problem Leveraging rich source domain information to target domain without labeled data.
method Discriminative Manifold Embedding and Alignment framework.
result Consistent transferability and discriminability achieved through manifold metric alignment.
SASE improves attributed graph clustering for large graphs with linear time and space complexity.
problem Challenges in clustering large attributed graphs due to high computational and memory costs.
method SASE combines node features smoothing, scalable spectral clustering, and adaptive order selection.
result SASE achieves a 6.9% improvement in ACC and a 5.87x speedup on the ArXiv dataset.
A new algorithm reduces the time for ordinal embedding, making it faster and more scalable.
problem Efficiently learning representations from ordinal comparisons, especially for large datasets.
method SVRG-SBB: Stochastic variance reduced gradient with adaptive step size.
result Achieves $O( rac{1}{T})$ convergence rate and global linear convergence under certain assumptions.
In this paper, we show that an embedded Weingarten surface in S^3 of genus 1 must be rotationally symmetric, provided that certain structure conditions are satisfied. The argument involves an adaptation of our proof of Lawson's Conjecture for minimal tori.
GDA-HIN adapts across heterogeneous networks by aligning shared and private node types.
problem Domain adaptation challenges in heterogeneous networks with shared and private node types.
method Generalized Domain Adaptive model across HINs (GDA-HIN) that aligns identical-type nodes and edges while utilizing different-type nodes and edges.
result GDA-HIN outperforms state-of-the-art methods in various domain adaptation tasks across heterogeneous networks.
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.
DANCE improves prediction set efficiency for deep learning models.
problem Inefficient, overly conservative prediction sets for pre-trained models.
method DANCE combines adaptive kernel regression and nearest-neighbor approach.
result DANCE produces more efficient and robust prediction sets.
Meta-learning technique bypasses data limitations by optimizing latent space.
problem Challenges in gradient-based meta-learning with high-dimensional parameter spaces in low-data regimes.
method Learning a latent generative representation of model parameters and performing meta-learning in this low-dimensional space.
result Achieves state-of-the-art performance on few-shot classification tasks.
New adaptive optimization methods for Riemannian manifolds improve training of complex models.
problem Adapting popular adaptive optimization methods to Riemannian manifolds.
method Generalized Adam, Adagrad, and Amsgrad to product Riemannian manifolds.
result Improved convergence and lower train loss on complex embedding tasks.
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.
Adapts DR objectives for both sample and feature size reduction.
problem Simultaneously reduce sample and feature sizes.
method Semi-relaxed Gromov-Wasserstein optimal transport.
result OT plan delivers competitive hard clustering.
New model uses financial news to predict stock returns.
problem Predicting stock returns based on financial news.
method Derive company embedding vectors from news, select basis assets, and use statistical methods.
result NEUS model outperforms Fama-French 5-factor model.
The paper develops embeddings to estimate causal effects from text data.
problem Estimating causal effects from text data with confounding features.
method Causally sufficient embeddings combining supervised dimensionality reduction and efficient language modeling.
result Causally sufficient embeddings improve causal estimation over related methods.
Adapted deep embeddings improve transfer learning across domains with limited labeled data.
problem Improving transfer learning performance with limited labeled data in related domains.
method Comparison and hybridization of weight transfer, deep metric learning, and few-shot learning methods.
result Hybrid adapted-embedding methods outperform state-of-the-art methods by 34%.
Combines foundation models with weak supervision to improve NLP and video tasks.
problem Leveraging weak supervision with foundation models without labeled data.
method Liger, a combination of foundation model embeddings and weak supervision techniques.
result Liger outperforms existing weak supervision methods by 14.1 points on benchmark NLP and video tasks.
GEM detects malicious accounts using adaptive embeddings from heterogeneous graphs.
problem Detecting malicious accounts on a leading mobile payment platform.
method Adaptive learning of discriminative embeddings from heterogeneous account-device graphs with attention mechanism for node importance.
result GEM consistently outperforms competitive methods in detecting malicious accounts.
Unified framework for convolution and attention models.
problem Complex neural network structures and their parameter control.
method Unified framework for convolution and attention models.
result Attention models are a special case of convolution with adaptive structure.
M-ADDA uses deep metric learning to adapt target datasets from similar source datasets.
problem Unsupervised domain adaptation for unlabeled target datasets.
method Metric learning and adversarial training to make target and source embeddings indistinguishable.
result M-ADDA outperforms ADDA on MNIST and USPS digit datasets.
Improved POS tagging for Twitter data with limited annotations.
problem Low-quality user-generated text for POS tagging.
method Domain adaptation using neural networks with feature embeddings and pre-trained embeddings.
result 90% tagging accuracy on German Tweets.