kdd 2023 - lea: improving sentence similarity robustness to typos using lexical attention bias
Published 1 year ago • 74 plays • Length 1:51Download video MP4
Download video MP3
Similar videos
-
1:43
kdd 2023 - learning-based ad auction design with externalities
-
1:59
kdd 2023 - estimating set similarity metrics for link prediction and document deduplication
-
2:15
kdd 2023 - similarity preserving adversarial graph contrastive learning
-
1:49
kdd 2023 - unifying aspect planning, lexical constraints generating explanations in recommendation
-
2:01
kdd 2023 - specify robust causal representation from mixed observations
-
1:55
kdd 2023 - robust positive-unlabeled learning via noise negative sample self-correction
-
1:53
kdd 2023 - on-device integrated re-ranking with heterogeneous behavior modeling
-
54:50
kdd2023 - keynote: people and machines: pathways to deeper human-ai synergy
-
4:56
hierarchical and non-hierarchical multi-agent interactions based on unity reinforcement learning
-
5:13
multi-agent drone reforestation - environment walkthrough - drlw at neurips2022
-
1:47
kdd 2023 - dual attention contrastive representation learning for time series anomaly detection
-
1:49
kdd 2023 - self-supervised classification clinical multivariate time series use time series dynamics
-
1:49
kdd2024 - tackling instance-dependent label noise with class rebalance and geometric regularization
-
1:58
kdd 2023 - scenario-adaptive feature interaction for click-through rate prediction
-
2:10
kdd 2023 - multi-task adversarial framework for cross-lingual natural language understanding
-
2:03
kdd 2024 - psmc: provable and scalable algorithms for motif conductance
-
1:51
kdd 2023 - revisiting neural retrieval on accelerators
-
1:53
kdd 2023 - doubly robust auc optimization against noisy and adversarial samples
-
1:58
kdd 2023 - hierarchical multi-agent deep reinforcement learning dynamic asynchronous macro strategy
-
2:00
kdd 2023 - cognitive evolutionary search to select feature interactions
-
1:45
kdd 2023 - efficient approximation algorithms for spanning centrality