Results 281 to 290 of about 3,110,326 (313)

Spiking NeRF: Representing the Real-World Geometry by a Discontinuous Representation

AAAI Conference on Artificial Intelligence, 2023
A crucial reason for the success of existing NeRF-based methods is to build a neural density field for the geometry representation via multiple perceptron layers (MLPs). MLPs are continuous functions, however, real geometry or density field is frequently
Zhanfeng Liao, Qian Zheng, Yan Liu, Gang Pan   +3 more
semanticscholar   +1 more source

F5-TTS: A Fairytaler that Fakes Fluent and Faithful Speech with Flow Matching

Annual Meeting of the Association for Computational Linguistics
This paper introduces F5-TTS, a fully non-autoregressive text-to-speech system based on flow matching with Diffusion Transformer (DiT). Without requiring complex designs such as duration model, text encoder, and phoneme alignment, the text input is ...
Yu-Shen Chen, Zhi-Kang Niu, Ziyang Ma, Keqi Deng, Chunhui Wang, Jian Zhao, Kai Yu, Xie Chen   +7 more
semanticscholar   +1 more source

Faithful Representations of Free Products

Journal of the London Mathematical Society, 1997
Let \((R_\alpha)_{\alpha\in\Lambda}\) be a family of domains of the same characteristic \(p\geq 0\). Let \((G_\alpha)_{\alpha\in\Lambda}\) be a family of matrix groups, \(G_\alpha\leq\text{GL}(n,R_\alpha)\), of the same degree \(n\geq 1\). The paper shows that the free product \(*_\alpha G_\alpha\) has a faithful representation of degree \(n+1\) over ...
openaire   +1 more source

Faithful Representations of Lie Algebras

The Annals of Mathematics, 1949
The object of this paper is to give a new proof of the theorem that every Lie algebra over a field K of characteristic zero, has a faithful representation. The first proof of this result, at least when K is algebraically closed, is due to Ado (1). Later Cartan (2) gave a simpler and entirely different proof for the case when K is the field of either ...
openaire   +2 more sources

Decoding on Graphs: Faithful and Sound Reasoning on Knowledge Graphs through Generation of Well-Formed Chains

arXiv.org
Knowledge Graphs (KGs) can serve as reliable knowledge sources for question answering (QA) due to their structured representation of knowledge. Existing research on the utilization of KG for large language models (LLMs) prevalently relies on subgraph ...
Kun Li, Tian-Hua Zhang, Xixin Wu, Hong-Yin Luo, James R. Glass, Helen M. Meng   +5 more
semanticscholar   +1 more source

Mitigating Large Language Model Hallucination with Faithful Finetuning

arXiv.org
Large language models (LLMs) have demonstrated remarkable performance on various natural language processing tasks. However, they are prone to generating fluent yet untruthful responses, known as"hallucinations".
Min-Da Hu, Bowei He, Yu-Fei Wang, Liangyou Li, Chen Ma, Irwin King   +5 more
semanticscholar   +1 more source

VCode: a Multimodal Coding Benchmark with SVG as Symbolic Visual Representation

arXiv.org
Code has emerged as a precise and executable medium for reasoning and action in the agent era. Yet, progress has largely focused on language-centric tasks such as program synthesis and debugging, leaving visual-centric coding underexplored.
K. Lin, Yu-Hao Zheng, Hang Ran, Dantong Zhu, Dong-Xing Mao, Linjie Li, Philip H. S. Torr, Alex Jinpeng Wang   +7 more
semanticscholar   +1 more source

Towards Faithful and Meaningful Interpretable Representations.

CoRR, 2020
Interpretable representations are the backbone of many black-box explainers. They translate the low-level data representation necessary for good predictive performance into high-level human-intelligible concepts used to convey the explanation. Notably, the explanation type and its cognitive complexity are directly controlled by the interpretable ...
Kacper Sokol, Peter A. Flach
openaire   +1 more source

Faithful and Plausible Natural Language Explanations for Image Classification: A Pipeline Approach

Conference on Empirical Methods in Natural Language Processing
Existing explanation methods for image classification struggle to provide faithful and plausible explanations. This paper addresses this issue by proposing a post-hoc natural language explanation method that can be applied to any CNN-based classifier ...
A. Wojciechowski, Mateusz Lango, Ondrej Dusek   +2 more
semanticscholar   +1 more source

Representations of Rings with Faithful Monoform Modules

Journal of the London Mathematical Society, 1984
Cet article a la même motivation que celle d'un article précédent de l'A. [Commun. Algebra 9, 23-45 (1981; Zbl 0469.16004)], à savoir l'étude d'une classe d'anneaux caractérisés par un théorème de densité analogue au théorème de densité de Jacobson. Un anneau R est dit anneau m-dense de transformations linéaires si c'est un sous- anneau de l'anneau des
openaire   +2 more sources