English
Related papers

Related papers: Bottom-Up Earley Deduction

200 papers

Derivative-free prompt learning has emerged as a lightweight alternative to prompt tuning, which only requires model inference to optimize the prompts. However, existing work did not take full advantage of the over-parameterized…

Computation and Language · Computer Science 2022-10-24 Yekun Chai , Shuohuan Wang , Yu Sun , Hao Tian , Hua Wu , Haifeng Wang

It is well known that for a given bottom-up tree automaton it can be decided whether or not there exists deterministic top-down tree automaton that recognized the same tree language. Recently it was claimed that such a decision can be…

Formal Languages and Automata Theory · Computer Science 2023-06-02 Sebastian Maneth , Helmut Seidl

Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…

Logic in Computer Science · Computer Science 2010-10-01 Alwen Tiu , Alberto Momigliano

Decoding for many NLP tasks requires an effective heuristic algorithm for approximating exact search since the problem of searching the full output space is often intractable, or impractical in many settings. The default algorithm for this…

Computation and Language · Computer Science 2022-11-16 Clara Meister , Tim Vieira , Ryan Cotterell

Answering complex questions often requires multi-step reasoning in order to obtain the final answer. Most research into decompositions of complex questions involves open-domain systems, which have shown success in using these decompositions…

Computation and Language · Computer Science 2022-12-21 Kangda Wei , Dawn Lawrie , Benjamin Van Durme , Yunmo Chen , Orion Weller

We prove that for a given partial functional attributed tree transducer with monadic output, it is decidable whether or not an equivalent top-down transducer (with or without look-ahead) exists. We present a procedure that constructs an…

Formal Languages and Automata Theory · Computer Science 2024-04-16 Sebastian Maneth , Martin Vu

In this paper, a new variant of accelerated gradient descent is proposed. The pro-posed method does not require any information about the objective function, usesexact line search for the practical accelerations of convergence, converges…

Optimization and Control · Mathematics 2019-05-14 Yurii Nesterov , Alexander Gasnikov , Sergey Guminov , Pavel Dvurechensky

Attention mechanisms have seen some success for natural language processing downstream tasks in recent years and generated new State-of-the-Art results. A thorough evaluation of the attention mechanism for the task of Argumentation Mining…

Computation and Language · Computer Science 2019-06-25 Maximilian Spliethöver , Jonas Klaff , Hendrik Heuer

Early stopping is a widely used technique to prevent poor generalization performance when training an over-expressive model by means of gradient-based optimization. To find a good point to halt the optimizer, a common practice is to split…

Machine Learning · Computer Science 2017-06-07 Maren Mahsereci , Lukas Balles , Christoph Lassner , Philipp Hennig

Deep robot vision models are widely used for recognizing objects from camera images, but shows poor performance when detecting objects at untrained positions. Although such problem can be alleviated by training with large datasets, the…

Robotics · Computer Science 2022-10-26 Hyogo Hiruma , Hiroki Mori , Hiroshi Ito , Tetsuya Ogata

We describe an efficient bottom-up parser that interleaves syntactic and semantic structure building. Two techniques are presented for reducing search by reducing local ambiguity: Limited left-context constraints are used to reduce local…

cmp-lg · Computer Science 2008-02-03 John Dowding , Robert Moore , Francois Andry , Douglas Moran

Top-down induction of decision trees has been observed to suffer from the inadequate functioning of the pruning phase. In particular, it is known that the size of the resulting tree grows linearly with the sample size, even though the…

Artificial Intelligence · Computer Science 2011-06-06 T. Elomaa , M. Kaariainen

Weakly-supervised semantic segmentation under image tags supervision is a challenging task as it directly associates high-level semantic to low-level appearance. To bridge this gap, in this paper, we propose an iterative bottom-up and…

Computer Vision and Pattern Recognition · Computer Science 2018-06-13 Xiang Wang , Shaodi You , Xi Li , Huimin Ma

For a bucket test with a single criterion for success and a fixed number of samples or testing period, requiring a $p$-value less than a specified value of $\alpha$ for the success criterion produces statistical confidence at level $1 -…

Methodology · Statistics 2024-08-05 Eric Bax , Arundhyoti Sarkar , Alex Shtoff

While deep learning has been very beneficial in data-rich settings, tasks with smaller training set often resort to pre-training or multitask learning to leverage data from other tasks. In this case, careful consideration is needed to…

Machine Learning · Computer Science 2021-08-26 Lucio M. Dery , Yann Dauphin , David Grangier

Hierarchical models are versatile tools for joint modeling of data sets arising from different, but related, sources. Fully Bayesian inference may, however, become computationally prohibitive if the source-specific data models are complex,…

Computation · Statistics 2016-05-06 Ritabrata Dutta , Paul Blomstedt , Samuel Kaski

Simple models are preferred over complex models, but over-simplistic models could lead to erroneous interpretations. The classical approach is to start with a simple model, whose shortcomings are assessed in residual-based model…

Methodology · Statistics 2019-10-22 Torsten Hothorn

There exist many high-dimensional data in real-world applications such as biology, computer vision, and social networks. Feature selection approaches are devised to confront with high-dimensional data challenges with the aim of efficient…

Machine Learning · Computer Science 2021-06-22 Mohsen Ghassemi Parsa , Hadi Zare , Mehdi Ghatee

We introduce a top-down approach to discourse parsing that is conceptually simpler than its predecessors (Kobayashi et al., 2020; Zhang et al., 2020). By framing the task as a sequence labelling problem where the goal is to iteratively…

Computation and Language · Computer Science 2021-04-07 Fajri Koto , Jey Han Lau , Timothy Baldwin

Many recent advances in deep learning for natural language processing have come at increasing computational cost, but the power of these state-of-the-art models is not needed for every example in a dataset. We demonstrate two approaches to…

Computation and Language · Computer Science 2017-12-18 Alexander Rosenberg Johansen , Richard Socher