English
Related papers

Related papers: Continuous Optimization for Satisfiability Modulo …

200 papers

In this paper, we study stochastic submodular maximization problems with general matroid constraints, that naturally arise in online learning, team formation, facility location, influence maximization, active learning and sensing objective…

Machine Learning · Computer Science 2023-03-20 Gözde Özcan , Stratis Ioannidis

This work focuses on effectively generating diverse solutions for satisfiability modulo theories (SMT) formulas, targeting the theories of bit-vectors, arrays, and uninterpreted functions, which is a critical task in software and hardware…

Software Engineering · Computer Science 2025-11-14 Shuangyu Lyu , Chuan Luo , Ruizhi Shi , Wei Wu , Chanjuan Liu , Chunming Hu

We study the problem of maximizing a monotone submodular set function subject to linear packing constraints. An instance of this problem consists of a matrix $A \in [0,1]^{m \times n}$, a vector $b \in [1,\infty)^m$, and a monotone…

Data Structures and Algorithms · Computer Science 2012-05-01 Yossi Azar , Iftah Gamzu

Distributed maximization of a submodular function in the MapReduce (MR) model has received much attention, culminating in two frameworks that allow a centralized algorithm to be run in the MR setting without loss of approximation, as long…

Data Structures and Algorithms · Computer Science 2024-09-17 Yixin Chen , Tonmoy Dey , Alan Kuhnle

In his monograph Chebyshev and Fourier Spectral Methods, John Boyd claimed that, regarding Fourier spectral methods for solving differential equations, ``[t]he virtues of the Fast Fourier Transform will continue to improve as the relentless…

Numerical Analysis · Mathematics 2023-02-03 Craig Gross , Mark Iwen

In the last decade we have witnessed an impressive progress in the expressiveness and efficiency of Satisfiability Modulo Theories (SMT) solving techniques. This has brought previously-intractable problems at the reach of state-of-the-art…

Logic in Computer Science · Computer Science 2015-01-19 Roberto Sebastiani , Patrick Trentin

SMT solvers use sophisticated techniques for polynomial (linear or non-linear) integer arithmetic. In contrast, non-polynomial integer arithmetic has mostly been neglected so far. However, in the context of program verification, polynomials…

Logic in Computer Science · Computer Science 2025-08-29 Florian Frohn , Jürgen Giesl

In the contexts of automated reasoning and formal verification, important decision problems are effectively encoded into Satisfiability Modulo Theories (SMT). In the last decade efficient SMT solvers have been developed for several theories…

Artificial Intelligence · Computer Science 2012-02-08 Roberto Sebastiani , Silvia Tomasi

Modular extremely large-scale MIMO (XL-MIMO) architectures combined with wireless fronthaul provide a scalable alternative to monolithic arrays, but their performance is sensitive to hardware impairments and resource allocation strategies.…

Signal Processing · Electrical Eng. & Systems 2026-05-25 Özlem Tuğfe Demir

Satisfiability Modulo Theory (SMT) has recently emerged as a powerful tool for solving various automated reasoning problems across diverse domains. Unlike traditional satisfiability methods confined to Boolean variables, SMT can reason on…

Logic in Computer Science · Computer Science 2025-08-14 Arijit Shaw , Uddalok Sarkar , Kuldeep S. Meel

Deploying Transformer-based large language models (LLMs) on resource-constrained edge devices for long-sequence tasks remains challenging due to the quadratic time complexity of self-attention and growing Key-Value (KV) cache demands. While…

Submodular continuous functions are a category of (generally) non-convex/non-concave functions with a wide spectrum of applications. We characterize these functions and demonstrate that they can be maximized efficiently with approximation…

Machine Learning · Computer Science 2019-05-07 Andrew An Bian , Baharan Mirzasoleiman , Joachim M. Buhmann , Andreas Krause

World foundation models, which simulate the physical world by predicting future states from current observations and inputs, have become central to many applications in physical intelligence, including autonomous driving and robotics.…

Computer Vision and Pattern Recognition · Computer Science 2025-08-11 Wenyan Cong , Hanqing Zhu , Peihao Wang , Bangya Liu , Dejia Xu , Kevin Wang , David Z. Pan , Yan Wang , Zhiwen Fan , Zhangyang Wang

Parameter-efficient fine-tuning (PEFT) has emerged as a crucial paradigm for adapting large language models (LLMs) under constrained computational budgets. However, standard PEFT methods often struggle in multi-task fine-tuning settings,…

Machine Learning · Computer Science 2026-04-03 Juyong Jiang , Fan Wang , Hong Qi , Sunghun Kim , Jing Tang

In this paper we study the adaptivity of submodular maximization. Adaptivity quantifies the number of sequential rounds that an algorithm makes when function evaluations can be executed in parallel. Adaptivity is a fundamental concept that…

Data Structures and Algorithms · Computer Science 2018-04-18 Eric Balkanski , Aviad Rubinstein , Yaron Singer

Classification and probability estimation are fundamental tasks with broad applications across modern machine learning and data science, spanning fields such as biology, medicine, engineering, and computer science. Recent development of…

Methodology · Statistics 2026-03-25 Liyun Zeng , Hao Helen Zhang

In this paper, we consider the general non-oblivious stochastic optimization where the underlying stochasticity may change during the optimization procedure and depends on the point at which the function is evaluated. We develop Stochastic…

Optimization and Control · Mathematics 2020-09-10 Hamed Hassani , Amin Karbasi , Aryan Mokhtari , Zebang Shen

Searches for signals at low signal-to-noise ratios frequently involve the Fast Fourier Transform (FFT). For high-throughput searches, we here consider FFT on the homogeneous mesh of Processing Elements (PEs) of a wafer-scale engine (WSE).…

Signal Processing · Electrical Eng. & Systems 2024-01-12 Maurice H. P. M. van Putten , Leighton Wilson , Adam W. Lavely , Mark Hair

Satisfiability Modulo Theories (SMT) specifications often rely on quantifiers to remain concise and declarative. However, checking the satisfiability of such specifications directly can be inefficient. A common optimization is to ground the…

Logic in Computer Science · Computer Science 2026-02-24 Pierre Carbonnelle

Simulators based on neural networks offer a path to orders-of-magnitude faster electromagnetic wave simulations. Existing models, however, only address narrowly tailored classes of problems and only scale to systems of a few dozen degrees…

Optics · Physics 2024-04-02 Charles Dove , Jatearoon Boondicharern , Laura Waller