Results 11 to 20 of about 86,360 (305)

"Curse of rarity" for autonomous vehicles [PDF]

open access: greenNature Communications, 2022
The curse of rarity—the rarity of safety-critical events in high-dimensional variable spaces—presents significant challenges in ensuring the safety of autonomous vehicles using deep learning.
Henry Liu, Shuo Feng
openalex   +3 more sources

A proof that rectified deep neural networks overcome the curse of dimensionality in the numerical approximation of semilinear heat equations [PDF]

open access: hybridSN Partial Differential Equations and Applications, 2020
Deep neural networks and other deep learning methods have very successfully been applied to the numerical approximation of high-dimensional nonlinear parabolic partial differential equations (PDEs), which are widely used in finance, engineering, and ...
Martin Hutzenthaler   +7 more
openalex   +3 more sources

Lifting the Curse of Multilinguality by Pre-training Modular Transformers [PDF]

open access: yesNorth American Chapter of the Association for Computational Linguistics, 2022
Multilingual pre-trained models are known to suffer from the curse of multilinguality, which causes per-language performance to drop as they cover more languages. We address this issue by introducing language-specific modules, which allows us to grow the
Jonas Pfeiffer   +6 more
semanticscholar   +1 more source

An Analysis and Mitigation of the Reversal Curse [PDF]

open access: yesConference on Empirical Methods in Natural Language Processing, 2023
Recent research observed a noteworthy phenomenon in large language models (LLMs), referred to as the ``reversal curse.'' The reversal curse is that when dealing with two entities, denoted as $a$ and $b$, connected by their relation $R$ and its inverse $R^
Ang Lv   +6 more
semanticscholar   +1 more source

Exploring the opportunities and challenges of NLP models in higher education: is Chat GPT a blessing or a curse?

open access: yesFrontiers in Education, 2023
COPYRIGHT © 2023 Fuchs. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright ...
K. Fuchs
semanticscholar   +1 more source

Is Metaverse in education a blessing or a curse: a combined content and bibliometric analysis

open access: yesSmart Learning Environments, 2022
The Metaverse has been the centre of attraction for educationists for quite some time. This field got renewed interest with the announcement of social media giant Facebook as it rebranding and positioning it as Meta.
A. Tlili   +20 more
semanticscholar   +1 more source

An empirical investigation into the impact of winner’s curse on estimates from Mendelian randomization

open access: yesmedRxiv, 2022
Introduction: Genetic associations for variants identified through genome-wide association studies (GWAS) tend to be overestimated in the original discovery dataset; as if the association was underestimated, the variant may not have been detected.
T. Jiang   +3 more
semanticscholar   +1 more source

Finite-Sample Guarantees for Wasserstein Distributionally Robust Optimization: Breaking the Curse of Dimensionality [PDF]

open access: yesOperational Research, 2020
Wasserstein distributionally robust optimization is a recent emerging modeling paradigm for decision making under data uncertainty. Because of its computational tractability and interpretability, it has achieved great empirical successes across several ...
Rui Gao
semanticscholar   +1 more source

Digital medicine and the curse of dimensionality

open access: yesnpj Digital Medicine, 2021
Digital health data are multimodal and high-dimensional. A patient’s health state can be characterized by a multitude of signals including medical imaging, clinical variables, genome sequencing, conversations between clinicians and patients, and ...
Visar Berisha   +6 more
semanticscholar   +1 more source

Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality

open access: yesTheory of Computing, 2012
We present two algorithms for the approximate nearest neighbor problem in high dimensional spaces. For data sets of size n living in IR d , the algorithms require space that is only polynomial in n and d , while achieving query times that are sub-linear ...
Sariel Har-Peled, P. Indyk, R. Motwani
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy