English
Related papers

Related papers: SMT Sampling via Model-Guided Approximation

200 papers

We introduce a novel modeling approach for time series imputation and forecasting, tailored to address the challenges often encountered in real-world data, such as irregular samples, missing data, or unaligned measurements from multiple…

Neural machine translation (NMT) models are typically trained with fixed-size input and output vocabularies, which creates an important bottleneck on their accuracy and generalization capability. As a solution, various studies proposed…

Computation and Language · Computer Science 2018-05-08 Duygu Ataman , Marcello Federico

Modelling problems containing a mixture of Boolean and numerical variables is a long-standing interest of Artificial Intelligence. However, performing inference and learning in hybrid domains is a particularly daunting task. The ability to…

Artificial Intelligence · Computer Science 2014-12-19 Stefano Teso , Roberto Sebastiani , Andrea Passerini

Data selection is essential for training deep learning models. An effective data sampler assigns proper sampling probability for training data and helps the model converge to a good local minimum with high performance. Previous studies in…

Machine Learning · Computer Science 2024-10-10 Jiawei Yao , Chuming Li , Canran Xiao

Score-based generative models can effectively learn the distribution of data by estimating the gradient of the distribution. Due to the multi-step denoising characteristic, researchers have recently considered combining score-based…

Machine Learning · Computer Science 2024-12-17 Changyuan Zhao , Hongyang Du , Guangyuan Liu , Dusit Niyato

Sampling-based motion planners (SBMPs) are widely used to compute dynamically feasible robot paths. However, their reliance on uniform sampling often leads to poor efficiency and slow planning in complex environments. We introduce a novel…

Robotics · Computer Science 2025-11-10 Shubham Natraj , Bruno Sinopoli , Yiannis Kantaros

Synthesis of models and strategies is a very important problem in software engineering. The main element here is checking the satisfiability of formulae expressing the specification of a system to be implemented. This paper puts forward a…

Logic in Computer Science · Computer Science 2020-02-11 Magdalena Kacprzak , Artur Niewiadomski , Wojciech Penczek

Satisfiability modulo theories (SMT) solving has become a critical part of many static analyses, including symbolic execution, refinement type checking, and model checking. We propose Formulog, a domain-specific language that makes it…

Programming Languages · Computer Science 2020-10-19 Aaron Bembenek , Michael Greenberg , Stephen Chong

Traditionally, in supervised machine learning, (a significant) part of the available data (usually 50% to 80%) is used for training and the rest for validation. In many problems, however, the data is highly imbalanced in regard to different…

Machine Learning · Computer Science 2020-04-21 Xiaowei Gu , Plamen P Angelov , Eduardo Almeida Soares

Test-time scaling paradigms have significantly advanced the capabilities of large language models (LLMs) on complex tasks. Despite their empirical success, theoretical understanding of the sample efficiency of various test-time strategies…

Machine Learning · Computer Science 2025-06-13 Baihe Huang , Shanda Li , Tianhao Wu , Yiming Yang , Ameet Talwalkar , Kannan Ramchandran , Michael I. Jordan , Jiantao Jiao

In this paper, we propose a novel framework, the Sampling-guided Heterogeneous Graph Neural Network (SHT-GNN), to effectively tackle the challenge of missing data imputation in longitudinal studies. Unlike traditional methods, which often…

Machine Learning · Computer Science 2024-11-08 Zhaoyang Zhang , Ziqi Chen , Qiao Liu , Jinhan Xie , Hongtu Zhu

The workflow satisfiability problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification that satisfies the constraints in the specification. The problem is NP-hard in general, but…

Data Structures and Algorithms · Computer Science 2015-05-18 D. Cohen , J. Crampton , A. Gagarin , G. Gutin , M. Jones

Decision procedures can be either theory-specific, e.g., Presburger arithmetic, or theory-generic, applying to an infinite number of user-definable theories. Variant satisfiability is a theory-generic procedure for quantifier-free…

Programming Languages · Computer Science 2017-09-18 Raúl Gutiérrez , José Meseguer

Sampling is a fundamental technique, and sampling without replacement is often desirable when duplicate samples are not beneficial. Within machine learning, sampling is useful for generating diverse outputs from a trained model. We present…

Machine Learning · Computer Science 2021-07-21 Kensen Shi , David Bieber , Charles Sutton

Supervised Machine Learning (SML) algorithms, such as Gradient Boosting, Random Forest, and Neural Networks, have become popular in recent years due to their superior predictive performance over traditional statistical methods. However,…

Machine Learning · Statistics 2020-07-30 Linwei Hu , Jie Chen , Vijayan N. Nair , Agus Sudjianto

Surrogate modeling is an essential data-driven technique for quantifying relationships between input variables and system responses in manufacturing and engineering systems. Two major challenges limit its effectiveness: (1) large data…

Machine Learning · Computer Science 2026-03-11 Manan Mehta , Zhiqiao Dong , Yuhang Yang , Chenhui Shao

The effects of personnel scheduling on the quality of care and working conditions for healthcare personnel have been thoroughly documented. However, the ever-present demand and large variation of constraints make healthcare scheduling…

Artificial Intelligence · Computer Science 2025-06-03 Alvin Combrink , Stephie Do , Kristofer Bengtsson , Sabino Francesco Roselli , Martin Fabian

We present a generalization of first-order unification to a term algebra where variable indexing is part of the object language. We exploit variable indexing by associating some sequences of variables ($X_0,\ X_1,\ X_2,\dots$) with a…

Logic in Computer Science · Computer Science 2024-03-12 David M. Cerna

The problem of heterogeneous clients in federated learning has recently drawn a lot of attention. Spectral model sharding, i.e., partitioning the model parameters into low-rank matrices based on the singular value decomposition, has been…

Machine Learning · Computer Science 2024-11-01 Denis Korzhenkov , Christos Louizos

Constrained-random simulation is the predominant approach used in the industry for functional verification of complex digital designs. The effectiveness of this approach depends on two key factors: the quality of constraints used to…

Logic in Computer Science · Computer Science 2014-03-26 Supratik Chakraborty , Kuldeep S. Meel , Moshe Y. Vardi