Abstractive summarization is an approach to document summarization that is not limited to selecting sentences from the document but can generate new sentences as well. We address the two main challenges in abstractive summarization: how to evaluate the performance of a summarization model and what is a good training objective. We first introduce new evaluation measures based on the semantic similarity of the input and corresponding summary. The similarity scores are obtained by the fine-tuned BERTurk model using either the cross-encoder or a bi-encoder architecture. The fine-tuning is done on the Turkish Natural Language Inference and Semantic Textual Similarity benchmark datasets. We show that these measures have better correlations with human evaluations compared to Recall-Oriented Understudy for Gisting Evaluation (ROUGE) scores and BERTScore. We then introduce a deep reinforcement learning algorithm that uses the proposed semantic similarity measures as rewards, together with a mixed training objective, in order to generate more natural summaries in terms of human readability. We show that training with a mixed training objective function compared to only the maximum-likelihood objective improves similarity scores.

Kolmogorov conditionalization is a strategy for updating credences based on propositions that have initial probability 0. I explore the connection between Kolmogorov conditionalization and Dutch books. Previous discussions of the connection rely crucially upon a factivity assumption: they assume that the agent updates credences based on true propositions. The factivity assumption discounts cases of misplaced certainty, i.e., cases where the agent invests credence 1 in a falsehood. Yet misplaced certainty arises routinely in scientific and philosophical applications of Bayesian decision theory. I prove a non-factive Dutch book theorem and converse Dutch book theorem for Kolmogorov conditionalization. The theorems do not rely upon the factivity assumption, so they establish that Kolmogorov conditionalization has unique pragmatic virtues that persist even in cases of misplaced certainty.

In this study, we present and assess data-driven approaches for modeling contact line dynamics, using droplet transport on chemically heterogeneous surfaces as a model system. Ground-truth data for training and validation are generated based on long-wave models that are applicable for slow droplet motion with small contact angles, which are known to accurately reproduce the dynamics with minimal computing resources compared to high-fidelity direct numerical simulations. The data-driven models are based on the Fourier neural operator (FNO) and are developed following two different approaches. The first deploys the data-driven method as an iterative neural network architecture, which predicts the future state of the contact line based on a number of previous states. The second approach corrects the time derivative of the contact line by augmenting its low-order asymptotic approximation with a data-driven counterpart, evolving the resulting system using standard time integration methods. The performance of each approach is evaluated in terms of accuracy and generalizability, concluding that the latter approach, although not originally explored within the original contribution on the FNO, outperforms the former.

Programming language semantics is an important topic in theoretical computer science, but one that beginners often find challenging. This article provides a tutorial introduction to the subject, in which the language of integers and addition is used as a minimal setting in which to present a range of semantic concepts in simple manner. In this setting, it is easy as 1,2,3.

This paper presents a kinematics modeling and hybrid motion planning framework for wheeled-legged rovers. It is a unified solution for wheeled-legged rovers to traverse multiple challenging terrains using hybrid locomotion. A kinematic model is first established to describe the rover’s motions. Then, a hybrid motion planning framework is proposed to determine the rover’s gait patterns and parameterize the legs’ and the body’s trajectories. Furthermore, an optimization algorithm based on B-spline is utilized to minimize the motors’ energy dissipation and generate smooth trajectories. The wheeled and legged hybridization allows the rover for faster locomotion while maintaining high stability. Besides, it also improves the rover’s ability to overcome obstacles. Prototype experiments are carried out in more complex environments to verify the rover’s flexibility and maneuverability to traverse irregular terrains. The proposed algorithm reduces the swing amplitude by 83.3% compared to purely legged locomotion.

We study the positivity and causality axioms for Markov categories as properties of dilations and information flow and also develop variations thereof for arbitrary semicartesian monoidal categories. These help us show that being a positive Markov category is merely an additional property of a symmetric monoidal category (rather than extra structure). We also characterize the positivity of representable Markov categories and prove that causality implies positivity, but not conversely. Finally, we note that positivity fails for quasi-Borel spaces and interpret this failure as a privacy property of probabilistic name generation.