English
Related papers

Related papers: Improving Coverage and Runtime Complexity for Exac…

200 papers

Despite the high performance of neural network-based time series forecasting methods, the inherent challenge in explaining their predictions has limited their applicability in certain application areas. Due to the difficulty in identifying…

Machine Learning · Computer Science 2023-01-09 Ozan Ozyegen , Juyoung Wang , Mucahit Cevik

Current algorithms for context-free parsing inflict a trade-off between ease of understanding, ease of implementation, theoretical complexity, and practical performance. No algorithm achieves all of these properties simultaneously. Might et…

Programming Languages · Computer Science 2016-04-19 Michael D. Adams , Celeste Hollenbeck , Matthew Might

There have been many recent investigations into prompt-based training of transformer language models for new text genres in low-resource settings. The prompt-based training approach has been found to be effective in generalizing pre-trained…

Computation and Language · Computer Science 2023-06-13 Jennifer D'Souza , Moussab Hrou , Sören Auer

We propose a conformal prediction method for constructing tight simultaneous prediction intervals for multiple, potentially related, numerical outputs given a single input. This method can be combined with any multi-target regression model…

Methodology · Statistics 2025-12-18 Yunjie Fan , Matteo Sesia

Generating semantically coherent text requires a robust internal representation of linguistic structures, which traditional embedding techniques often fail to capture adequately. A novel approach, Latent Lexical Projection (LLP), is…

Computation and Language · Computer Science 2025-03-26 Ziad Shaker , Brendan Ashdown , Hugo Fitzalan , Alistair Heathcote , Jocasta Huntington

Constructor rewriting systems are said to be cons-free if any constructor term occurring in the rhs of a rule must be a subterm of the lhs of the rule. Roughly, such systems cannot build new data structures during their evaluation. In…

Logic in Computer Science · Computer Science 2017-11-10 Cynthia Kop , Jakob Grue Simonsen

We introduce a novel framework for temporal causal discovery and inference that addresses two key challenges: complex nonlinear dependencies and spurious correlations. Our approach employs a multi-layer Transformer-based time-series…

Machine Learning · Computer Science 2025-08-25 Jihua Huang , Yi Yao , Ajay Divakaran

Time-series prediction has drawn considerable attention during the past decades fueled by the emerging advances of deep learning methods. However, most neural network based methods lack interpretability and fail in extracting the hidden…

Machine Learning · Computer Science 2023-03-03 Xiaoyi Liu , Duxin Chen , Wenjia Wei , Xia Zhu , Wenwu Yu

Accurate forecasting of renewable energy generation is fundamental to enhancing the dynamic performance of modern power grids, especially under high renewable penetration. This paper presents Channel-Time Patch Time-Series Transformer…

Machine Learning · Computer Science 2026-01-23 Kuan Lu , Menghao Huo , Yuxiao Li , Qiang Zhu , Zhenrui Chen

Multivariate time-series analysis involves extracting informative representations from sequences of multiple interdependent variables, supporting tasks such as forecasting, imputation, and anomaly detection. In real-world scenarios, these…

Machine Learning · Computer Science 2026-05-19 Israel Zexer , Omri Azencot

Transformers for time series forecasting mainly model time series from limited or fixed scales, making it challenging to capture different characteristics spanning various scales. We propose Pathformer, a multi-scale Transformer with…

Machine Learning · Computer Science 2024-09-17 Peng Chen , Yingying Zhang , Yunyao Cheng , Yang Shu , Yihang Wang , Qingsong Wen , Bin Yang , Chenjuan Guo

Bayesian networks (BNs) are attractive, because they are graphical and interpretable machine learning models. However, exact inference on BNs is time-consuming, especially for complex problems. To improve the efficiency, we propose a fast…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-03-14 Jiantong Jiang , Zeyi Wen , Atif Mansoor , Ajmal Mian

Inductive families provide a convenient way of programming with dependent types. Yet, when it comes to compilation, their default linked-tree runtime representations, as well as the need to convert between different indexed views of the…

Programming Languages · Computer Science 2025-05-29 Constantine Theocharis , Edwin Brady

Recent progress in semantic parsing scarcely considers languages other than English but professional translation can be prohibitively expensive. We adapt a semantic parser trained on a single language, such as English, to new languages and…

Computation and Language · Computer Science 2020-09-24 Tom Sherborne , Yumo Xu , Mirella Lapata

Transition-based models can be fast and accurate for constituent parsing. Compared with chart-based models, they leverage richer features by extracting history information from a parser stack, which spans over non-local constituents. On the…

Computation and Language · Computer Science 2016-12-05 Jiangming Liu , Yue Zhang

Deep learning models with convolutional and recurrent networks are now ubiquitous and analyze massive amounts of audio, image, video, text and graph data, with applications in automatic translation, speech-to-text, scene understanding,…

In this work, we present a novel conformal prediction method for time-series, which we call Kernel-based Optimally Weighted Conformal Prediction Intervals (KOWCPI). Specifically, KOWCPI adapts the classic Reweighted Nadaraya-Watson (RNW)…

Machine Learning · Computer Science 2026-02-12 Jonghyeok Lee , Chen Xu , Yao Xie

Transformer models have demonstrated exceptional performance across a wide range of applications. Though forming the foundation of Transformer models, the dot-product attention does not scale well to long-context data since its time…

Machine Learning · Computer Science 2025-03-14 Yongchang Hao , Mengyao Zhai , Hossein Hajimirsadeghi , Sepidehsadat Hosseini , Frederick Tung

Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In earlier work, the authors have shown that for confluent TRSs, innermost…

Computational Complexity · Computer Science 2011-06-09 Martin Avanzini , Georg Moser

Dependency parsing is a crucial step towards deep language understanding and, therefore, widely demanded by numerous Natural Language Processing applications. In particular, left-to-right and top-down transition-based algorithms that rely…

Computation and Language · Computer Science 2022-10-27 Daniel Fernández-González , Carlos Gómez-Rodríguez
‹ Prev 1 8 9 10 Next ›