Related papers: Continuity conditions weaker than lower semi-conti…
Causal continuity is usually defined by imposing the conditions (i) distinction and (ii) reflectivity. It is proved here that a new causality property which stays between weak distinction and causality, called feeble distinction, can…
Pretext-based self-supervised learning learns the semantic representation via a handcrafted pretext task over unlabeled data and then uses the learned representation for downstream tasks, which effectively reduces the sample complexity of…
Constrained clustering allows the training of classification models using pairwise constraints only, which are weak and relatively easy to mine, while still yielding full-supervision-level model performance. While they perform well even in…
This paper considers quasi-reductivity - essentially, the property that an evaluation cannot get "stuck" due to a missing case in pattern matching - in the context of term rewriting with logical constraints.
This letter analyzes the contraction property of the nonlinear systems controlled by suboptimal model predictive control (MPC) using the continuation method. We propose a contraction metric that reflects the hierarchical dynamics inherent…
Causal discovery, the problem of inferring the direction of causality, is generally ill-posed. We use the language of structural causal models (SCM) to show that assuming that the causal relations are acyclic and invariant across multiple…
Sub-sub-intuitionistic logic is obtained from intuitionistic logic by weakening the implication and removing distributivity. It can alternatively be viewed as conditional weak positive logic. We provide semantics for sub-sub-intuitionistic…
This is an exposition on supercyclicity and weak supercyclicity, especially designed to advance further developments in weakly supercyclicity, which is a recent research field showing significant momentum during the past two decades. For…
We show how to improve the semicontinuity bounds in [1] by optimizing the proof of the basic technical lemma. In this optimization we apply the modified version of the trick used in the resent article [2]. The most important applications…
Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…
We introduce a variant of transition systems, where activation of transitions depends on conditions of the environment and upgrades during runtime potentially create additional transitions. Using a cornerstone result in lattice theory, we…
In recent years much effort has been concentrated towards achieving polynomial time lower bounds on algorithms for solving various well-known problems. A useful technique for showing such lower bounds is to prove them conditionally based on…
The idea of partial smoothness in optimization blends certain smooth and nonsmooth properties of feasible regions and objective functions. As a consequence, the standard first-order conditions guarantee that diverse iterative algorithms…
The linearization of the meteorological equations around a specified reference state, usually applied in NWP to define the linear system of constant-coefficients semi-implicit schemes, is outlined as an unnecessarily restrictive approach…
Long-context reasoning is essential for complex real-world applications, yet remains a significant challenge for Large Language Models (LLMs). Despite the rapid evolution in long-context reasoning, current research often overlooks the…
In-context learning (ICL) has emerged as an effective approach to enhance the performance of large language models (LLMs). However, its effectiveness varies significantly across models and tasks, posing challenges for practitioners to…
A brief overview of some open questions in general relativity with important consequences for causality theory is presented, aiming to a better understanding of the causal structure of the spacetime. Special attention is accorded to the…
Although the Karush-Kuhn-Tucker conditions suggest a connection between a conic optimization problem and a complementarity problem, it is difficult to find an accessible explicit form of this relationship in the literature. This note will…
We investigate connections between SAT (the propositional satisfiability problem) and combinatorics, around the minimum degree (number of occurrences) of variables in various forms of redundancy-free boolean conjunctive normal forms…
The end of LEP and SLC is a good moment to review the way to summarize search results in order to exploit at best, in future analyses and speculations, the pieces of information coming from all experiments. Some known problems with the…