English
Related papers

Related papers: Galois Transformers and Modular Abstract Interpret…

200 papers

Proof assistants are getting more widespread use in research and industry to provide certified and independently checkable guarantees about theories, designs, systems and implementations. However, proof assistant implementations themselves…

Programming Languages · Computer Science 2021-07-19 Matthieu Sozeau

Understanding simplicity biases in deep learning offers a promising path toward developing reliable AI. A common metric for this, inspired by Boolean function analysis, is average sensitivity, which captures a model's robustness to…

Machine Learning · Computer Science 2026-02-10 Themistoklis Haris , Zihan Zhang , Yuichi Yoshida

End-to-end optimization has achieved state-of-the-art performance on many specific problems, but there is no straight-forward way to combine pretrained models for new problems. Here, we explore improving modularity by learning a post-hoc…

Machine Learning · Computer Science 2019-02-25 Yingtao Tian , Jesse Engel

Static analysis tools typically address the problem of excessive false positives by requiring programmers to explicitly annotate their code. However, when faced with incomplete annotations, many analysis tools are either too conservative,…

Programming Languages · Computer Science 2021-07-16 Sam Estep , Jenna Wise , Jonathan Aldrich , Éric Tanter , Johannes Bader , Joshua Sunshine

Convolution is a broadly useful operation with applications including signal processing, machine learning, probability, optics, polynomial multiplication, and efficient parsing. Usually, however, this operation is understood and implemented…

Programming Languages · Computer Science 2019-03-27 Conal Elliott

We present a framework for compositional program verification based on polynomial functors in dependent type theory. In this framework, polynomial functors serve as program interfaces, Kleisli morphisms for the free monad monad serve as…

Logic in Computer Science · Computer Science 2026-04-03 C. B. Aberlé

Gradually typed programming languages, which allow for soundly mixing static and dynamically typed programming styles, present a strong challenge for metatheorists. Even the simplest sound gradually typed languages feature at least…

Programming Languages · Computer Science 2025-07-14 Eric Giovannini , Tingting Ding , Max S. New

Transformers serve as the foundational architecture for large language and video generation models, such as GPT, BERT, SORA and their successors. Empirical studies have demonstrated that real-world data and learning tasks exhibit…

Machine Learning · Computer Science 2026-05-19 Zhaiming Shen , Alex Havrilla , Rongjie Lai , Alexander Cloninger , Wenjing Liao

The proliferation of Large Language Models (LLMs) has catalyzed a shift towards autonomous agents capable of complex reasoning and tool use. However, current agent architectures are frequently constructed using imperative, ad hoc patterns.…

Artificial Intelligence · Computer Science 2026-01-23 Yifan Zhang , Yang Yuan , Mengdi Wang , Andrew Chi-Chih Yao

Streaming generation models are utilized across fields, with the Transducer architecture being popular in industrial applications. However, its input-synchronous decoding mechanism presents challenges in tasks requiring non-monotonic…

Computation and Language · Computer Science 2025-05-29 Zhengrui Ma , Yang Feng , Min Zhang

Common programming tools, like compilers, debuggers, and IDEs, crucially rely on the ability to analyse program code to reason about its behaviour and properties. There has been a great deal of work on verifying compilers and static…

Programming Languages · Computer Science 2019-07-15 Jan Stolarek , James Cheney

The ability to think abstractly and reason by analogy is a prerequisite to rapidly adapt to new conditions, tackle newly encountered problems by decomposing them, and synthesize knowledge to solve problems comprehensively. We present…

Artificial Intelligence · Computer Science 2024-10-08 Jakub Bednarek , Krzysztof Krawiec

Meromorphic germs in several variables with linear poles naturally arise in mathematics in various disguises. We investigate their rich structures under the prism of locality, including locality subalgebras, locality transformation groups…

Mathematical Physics · Physics 2023-01-09 Li Guo , Sylvie Paycha , Bin Zhang

ion is one of the most promising approaches to improve the performance of problem solvers. In several domains abstraction by dropping sentences of a domain description -- as used in most hierarchical planners -- has proven useful. In this…

Artificial Intelligence · Computer Science 2009-09-25 R. Bergmann , W. Wilke

The purpose of this paper is to constructively develop a Galois theory on irreducible shifts of finite type (SFTs) and to analyze the automorphism groups of SFTs using this framework. Let $X$ and $Y$ be irreducible SFTs. We demonstrate that…

Dynamical Systems · Mathematics 2026-05-28 Kazutoyo Iketake

Recent advances in multilingual dependency parsing have brought the idea of a truly universal parser closer to reality. However, cross-language interference and restrained model capacity remain major obstacles. To address this, we propose a…

Computation and Language · Computer Science 2020-10-07 Ahmet Üstün , Arianna Bisazza , Gosse Bouma , Gertjan van Noord

Aggregation functions are widely used in answer set programming for representing and reasoning on knowledge involving sets of objects collectively. Current implementations simplify the structure of programs in order to optimize the overall…

Artificial Intelligence · Computer Science 2020-02-19 Mario Alviano , Wolfgang Faber , Martin Gebser

Recent advances in pre-trained vision transformers have shown promise in parameter-efficient audio-visual learning without audio pre-training. However, few studies have investigated effective methods for aligning multimodal features in…

Computer Vision and Pattern Recognition · Computer Science 2024-06-10 Tanvir Mahmud , Shentong Mo , Yapeng Tian , Diana Marculescu

Model transformation tools assist system designers by reducing the labor--intensive task of creating and updating models of various aspects of systems, ensuring that modeling assumptions remain consistent across every model of a system, and…

Systems and Control · Computer Science 2019-07-02 Natasha Jarus , Sahra Sedigh Sarvestani , Ali Hurson

Monadic decomposibility --- the ability to determine whether a formula in a given logical theory can be decomposed into a boolean combination of monadic formulas --- is a powerful tool for devising a decision procedure for a given logical…

Formal Languages and Automata Theory · Computer Science 2019-05-09 Pablo Barcelo , Chih-Duo Hong , Xuan-Bach Le , Anthony W. Lin , Reino Niskanen
‹ Prev 1 8 9 10 Next ›