Local Convergence of Critical Random Trees and Continuous-State Branching Processes

He, Xin

doi:10.1007/s10959-021-01074-9

Search citation statements

Order By: Relevance

Paper Sections

Select...

Text-to-sql1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Apart from these two families, [20,21] use Transformers [22,23] with tree positional encodings to enable tree-based decoders and get a good result. [24] use an intermediate representation SemQL query which bridges Natural Language and SQL.…”

Section: Text-to-sqlmentioning

confidence: 99%

Light RAT-SQL: A RAT-SQL with More Abstraction and Less Embedding of Pre-existing Relations

Ndongala¹

2023

TIJAR

View full text Add to dashboard Cite

RAT-SQL is among the popular framework used in the Text-To-SQL challenges for jointly encoding the database relations and questions in a way to improve the semantic parser. In this work, we propose a light version of the RAT-SQL where we dramatically reduced the number of the preexisting relations from 55 to 7 (Light RAT-SQL-7) while preserving the same parsing accuracy. To ensure the effectiveness of our approach, we trained a Light RAT-SQL-2, (with 2 embeddings) to show that there is a statistically significant difference between RAT-SQL and Light RAT-SQL-2 while Light RAT-SQL-7 can compete with RAT-SQL. Keywords: Deep learning, Natural Language Processing, Neural Semantic Parsing, Relation Aware Transformer, RAT-SQL, Text-To-SQL, Transformer.

show abstract

Section: Text-to-sqlmentioning

confidence: 99%

Light RAT-SQL: A RAT-SQL with More Abstraction and Less Embedding of Pre-existing Relations

Ndongala¹

2023

TIJAR

View full text Add to dashboard Cite

show abstract

Local convergence of critical Galton–Watson trees

Bouaziz

2023

J. Appl. Probab.

View full text Add to dashboard Cite

We study the local convergence of critical Galton–Watson trees under various conditionings. We give a sufficient condition, which serves to cover all previous known results, for the convergence in distribution of a conditioned Galton–Watson tree to Kesten’s tree. We also propose a new proof to give the limit in distribution of a critical Galton–Watson tree, with finite support, conditioned on having a large width.

show abstract

Local Convergence of Critical Random Trees and Continuous-State Branching Processes

Cited by 2 publications

References 15 publications

Light RAT-SQL: A RAT-SQL with More Abstraction and Less Embedding of Pre-existing Relations

Light RAT-SQL: A RAT-SQL with More Abstraction and Less Embedding of Pre-existing Relations

Local convergence of critical Galton–Watson trees

Contact Info

Product

Resources

About