English
Related papers

Related papers: Extensional Collapse Situations I: non-termination…

200 papers

Classification of ordinal data is one of the most important tasks of relation learning. In this thesis a novel framework for ordered classes is proposed. The technique reduces the problem of classifying ordered classes to the standard…

Artificial Intelligence · Computer Science 2007-05-23 Jaime S. Cardoso

Ordinal regression is a classification task where classes have an order and prediction error increases the further the predicted class is from the true class. The standard approach for modeling ordinal data involves fitting parallel…

Machine Learning · Computer Science 2022-02-16 Fred Lu , Francis Ferraro , Edward Raff

Training models on uncurated Text Embeddings (TEs) derived from raw tabular data can lead to a severe failure mode known as model collapse, where predictions converge to a single class regardless of input. By comparing models trained with…

Machine Learning · Computer Science 2025-06-24 Lucas Mattioli , Youness Ait Hadichou , Sabrina Chaouche , Martin Gonzalez

We revisit evaluation of logical formulas that allow both uninterpreted relations, constrained to be finite, as well as an interpreted vocabulary over an infinite domain. This formalism was denoted embedded finite model theory in the past.…

Logic in Computer Science · Computer Science 2024-05-22 Michael Benedikt , Ehud Hrushovski

It is shown that propositional calculuses of both quantum and classical logics are non-categorical. We find that quantum logic is in addition to an orthomodular lattice also modeled by a weakly orthomodular lattice and that classical logic…

Quantum Physics · Physics 2007-05-23 Mladen Pavicic , Norman D. Megill

A leading twist expansion in terms of bilocal operators is proposed for the structure functions of deeply inelastic scattering near the elastic limit $x \to 1$, which is also applicable to a range of other hard quasi-elastic processes.…

High Energy Physics - Phenomenology · Physics 2007-05-23 Ratindranath Akhoury , Michael G. Sotiropoulos , George Sterman

In this work we provide alternative formulations of the concepts of lambda theory and extensional theory without introducing the notion of substitution and the sets of all, free and bound variables occurring in a term. We also clarify the…

Logic in Computer Science · Computer Science 2019-03-21 Michele Basaldella

We propose a technique for reformulation of state and parameter estimation problems as that of matching explicitly computable definite integrals with known kernels to data. The technique applies for a class of systems of nonlinear ordinary…

Optimization and Control · Mathematics 2013-09-11 I. Yu. Tyukin , A. N. Gorban

In this work the standard kinetic theory assumption of instantaneous collisions is lifted. As a continuation of of a previous paper by Kanzler, Schmeiser, and Tora [KRM, 2024], a model for higher order non-instantaneous alignment collisions…

Analysis of PDEs · Mathematics 2025-07-03 Laura Kanzler , Carmela Moschella , Christian Schmeiser

One-loop functions with loop masses larger than external masses and momenta can always be expanded in terms of external masses and momenta. The precision requested for observables determines the number of the expansion terms retained in the…

High Energy Physics - Phenomenology · Physics 2014-07-11 Amon Ilakovac , Luka Popov

We analyze multivariate ordered discrete response models with a lattice structure, modeling decision makers who narrowly bracket choices across multiple dimensions. These models map latent continuous processes into discrete responses using…

Econometrics · Economics 2025-11-06 Tatiana Komarova , William Matcham

We present a static analysis technique for non-termination inference of logic programs. Our framework relies on an extension of the subsumption test, where some specific argument positions can be instantiated while others are generalized.…

Programming Languages · Computer Science 2007-05-23 Etienne Payet , Fred Mesnard

We explore the Carlemann linearization of the collision term of the lattice Boltzmann formulation, as a first step towards formulating a quantum lattice Boltzmann algorithm. Specifically, we deal with the case of a single, incompressible…

Fluid Dynamics · Physics 2021-11-23 Wael Itani , Sauro Succi

Questions that seek to determine whether a hyperplane arrangement property, be it geometric, arithmetic or topological, is of a combinatorial nature (that is determined by the intersection lattice) are abundant in the literature. To tackle…

Algebraic Geometry · Mathematics 2021-11-02 Benoît Guerville-Ballé

We study existence and Lorentz regularity of distributional solutions to elliptic equations with either a convection or a drift first order term. The presence of such a term makes the problem not coercive. The main tools are pointwise…

Analysis of PDEs · Mathematics 2021-06-16 Stefano Buccheri

This document introduces a strategy to solve linear optimization problems. The strategy is based on the bounding condition each constraint produces on each one of the problem's dimension. The solution of a linear optimization problem is…

Optimization and Control · Mathematics 2018-09-24 Gerardo L. Febres

In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinations of resource lambda-terms, from a calculus similar to Boudol's…

Logic in Computer Science · Computer Science 2010-01-20 Thomas Ehrhard

We prove an extension of Yuan's Lemma to more than two matrices, as long as the set of matrices has rank at most 2. This is used to generalize the main result of [A. Baccari and A. Trad. On the classical necessary second-order optimality…

Optimization and Control · Mathematics 2017-07-20 Gabriel Haeser

Inspired by so many possible applications of this class of problems, we seek solution for non-cooperative elliptic systems of two Schrodinger equations. General conditions are assumed under the potentials, which produces convenient…

Analysis of PDEs · Mathematics 2018-11-01 Liliane A. Maia , Mayra Soares , Ricardo Ruviaro

We consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is…

Logic in Computer Science · Computer Science 2014-12-11 Fred Mesnard , Etienne Payet
‹ Prev 1 4 5 6 7 8 10 Next ›