arXiv subjects

Mark Squillante

Publications and source records attributed to Mark Squillante.

5 recordsLinked to original sources

arXiv2026

SynPAT: A System for Generating Synthetic Physical Theories with Data

Machine-assisted methods for discovering physical laws from background theory and data have recently emerged, promising to advance our understanding of the physical world. However, training and benchmarking these systems remains challenging: real physical theories are limited in number. To address this need, we introduce SynPAT, a system for generating synthetic physical theories with accompanying data. SynPAT produces: (i) a consistent set of axioms forming a synthetic theory, (ii) a symbolic consequence of these axioms representing the discovery target, and (iii) noisy data approximating this consequence. Crucially, to mirror historically incorrect theories (e.g., Newtonian mechanics before Special Relativity), SynPAT can also generate theories whose axioms do not strictly entail, and in fact conflict with, the observed consequence, requiring a correction to the assumed axioms to bridge the gap. We detail SynPAT's methodology and benchmark several open-source symbolic regression systems on our generated theories and data.

cs.SC↗

arXiv2025

Towards a Unification of Logic and Information Theory

Today, the vast majority of the world's digital information is represented using the fundamental assumption, introduced by Claude Shannon in 1948, that ``...the semantic aspects of communication are irrelevant to the engineering problem (of the design of communication systems)...''. Consider, nonetheless, the observation that we often combine a message with other information in order to deduce new facts, thereby expanding the value of such a message. It is noteworthy that to-date, no rigorous theory of communication has been put forth which postulates the existence of deductive capabilities on the receiver's side. The purpose of this paper is to present such a theory. We formally model such deductive capabilities using logic reasoning, and present a rigorous theory which covers the following generic scenario: Alice and Bob each have knowledge of some logic sentence, and they wish to communicate as efficiently as possible with the shared goal that, following their communication, Bob should be able to deduce a particular logic sentence that Alice knows to be true, but that Bob currently cannot prove. Many variants of this general setup are considered in this article; in all cases we are able to provide sharp upper and lower bounds. Our contribution includes the identification of the most fundamental requirements that we place on a logic and associated logical language for all of our results to apply. Practical algorithms that are in some cases asymptotically optimal are provided, and we illustrate the potential practical value of the design of communication systems that incorporate the assumption of deductive capabilities at the receiver using experimental results that suggest significant possible gains compared to classical systems.

cs.IT↗

arXiv2020

Unbiased Gradient Estimation for Distributionally Robust Learning

Seeking to improve model generalization, we consider a new approach based on distributionally robust learning (DRL) that applies stochastic gradient descent to the outer minimization problem. Our algorithm efficiently estimates the gradient of the inner maximization problem through multi-level Monte Carlo randomization. Leveraging theoretical results that shed light on why standard gradient estimators fail, we establish the optimal parameterization of the gradient estimators of our approach that balances a fundamental tradeoff between computation time and statistical variance. Numerical experiments demonstrate that our DRL approach yields significant benefits over previous work.

stat.ML↗

arXiv2020

Efficient Stochastic Gradient Descent for Learning with Distributionally Robust Optimization

Distributionally robust optimization (DRO) problems are increasingly seen as a viable method to train machine learning models for improved model generalization. These min-max formulations, however, are more difficult to solve. We therefore provide a new stochastic gradient descent algorithm to efficiently solve this DRO formulation. Our approach applies gradient descent to the outer minimization formulation and estimates the gradient of the inner maximization based on a sample average approximation. The latter uses a subset of the data in each iteration, progressively increasing the subset size to ensure convergence. Theoretical results include establishing the optimal manner for growing the support size to balance a fundamental tradeoff between stochastic error and computational effort. Empirical results demonstrate the significant benefits of our approach over previous work, and also illustrate how learning with DRO can improve generalization.

stat.ML↗

arXiv2017

On the Control of Density-Dependent Stochastic Population Processes with Time-Varying Behavior

The study of density-dependent stochastic population processes is important from a historical perspective as well as from the perspective of a number of existing and emerging applications today. In more recent applications of these processes, it can be especially important to include time-varying parameters for the rates that impact the density-dependent population structures and behaviors. Under a mean-field scaling, we show that such density-dependent stochastic population processes with time-varying behavior converge to a corresponding dynamical system. We analogously establish that the optimal control of such density-dependent stochastic population processes converges to the optimal control of the limiting dynamical system. An analysis of both the dynamical system and its optimal control renders various important mathematical properties of interest.

math.OC↗