English
Related papers

Related papers: Stationarily ordered types and the number of count…

200 papers

High dimensional covariance estimation and graphical models is a contemporary topic in statistics and machine learning having widespread applications. An important line of research in this regard is to shrink the extreme spectrum of the…

Methodology · Statistics 2016-06-28 Sang-Yun Oh , Bala Rajaratnam , Joong-Ho Won

Stacking is a widely used model averaging technique that asymptotically yields optimal predictions among linear averages. We show that stacking is most effective when model predictive performance is heterogeneous in inputs, and we can…

Methodology · Statistics 2021-10-29 Yuling Yao , Gregor Pirš , Aki Vehtari , Andrew Gelman

We study the dependent type theory CaTT, introduced by Finster and Mimram, which presents the theory of weak $\omega$-categories, following the idea that type theories can be considered as presentations of generalized algebraic theories.…

Logic in Computer Science · Computer Science 2024-02-05 Thibaut Benjamin , Eric Finster , Samuel Mimram

In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…

Logic in Computer Science · Computer Science 2011-02-15 Saeed Asaeedi , Farzad Didehvar

Let $A$ and $B$ be compact operators over a topological space $X$ and suppose that these operators are normal and have same distinct eigenvalues at each point. By obstruction theory, we establish a necessary and sufficient condition for $A$…

Functional Analysis · Mathematics 2017-09-04 Jingming Zhu

This paper presents a theory of non-linear integer/real arithmetic and algorithms for reasoning about this theory. The theory can be conceived as an extension of linear integer/real arithmetic with a weakly-axiomatized multiplication…

Logic in Computer Science · Computer Science 2022-11-09 Zachary Kincaid , Nicolas Koh , Shaowei Zhu

In statistical research there usually exists a choice between structurally simpler or more complex models. We argue that, even if a more complex, locally stationary time series model were true, then a simple, stationary time series model…

Statistics Theory · Mathematics 2019-08-16 Tobias Kley , Philip Preuß , Piotr Fryzlewicz

In these lectures we explain the intimate relationship between modular invariants in conformal field theory and braided subfactors in operator algebras. A subfactor with a braiding determines a matrix $Z$ which is obtained as a coupling…

Operator Algebras · Mathematics 2007-05-23 J. Böckenhauer , D. E. Evans

Prior work has shown that causal structure can be uniquely identified from observational data when these follow a structural equation model whose error terms have equal variances. We show that this fact is implied by an ordering among…

Methodology · Statistics 2021-05-25 Wenyu Chen , Mathias Drton , Y. Samuel Wang

We present intersection type systems in the style of sequent calculus, modifying the systems that Valentini introduced to prove normalisation properties without using the reducibility method. Our systems are more natural than Valentini's…

Logic in Computer Science · Computer Science 2015-03-18 Kentaro Kikuchi

A random dense countable set is characterized (in distribution) by independence and stationarity. Two examples are `Brownian local minima' and `unordered infinite sample'. They are identically distributed. A framework for such concepts,…

Probability · Mathematics 2007-05-23 Boris Tsirelson

We propose to identify directions invariant to a given classifier so that these directions can be controlled in tasks such as style transfer. While orthogonal decomposition is directly identifiable when the given classifier is linear, we…

Machine Learning · Computer Science 2022-01-28 Yilun Xu , Hao He , Tianxiao Shen , Tommi Jaakkola

We hope to see how much for a model M of some completion T of PA (Peano Arithmetic) does M restriction {<} determine M, say up to isomorphism. We advance in characterizing for non-standard models M of PA the "minimal" set {(a,b):n < a < b…

Logic · Mathematics 2012-06-12 Saharon Shelah

Aiming at a complete classification of unitary N=2 minimal models (where the assumption of space-time supersymmetry has been dropped), it is shown that each modular invariant candidate of a partition function for such a theory is indeed the…

High Energy Physics - Theory · Physics 2012-06-19 Oliver Gray

For a countable, complete, first-order theory $T$, we study $At$, the class of atomic models of $T$. We develop an analogue of $U$-rank and prove two results. On one hand, if some tp(d/a) is not ranked, then there are $2^{\aleph_1}$…

Logic · Mathematics 2025-02-04 John T. Baldwin , Michael C. Laskowski , Saharon Shelah

Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…

Logic · Mathematics 2020-06-02 Eliahu Levy

The infinite random size-biased order with arbitrary positive size parameters is introduced in terms of independent exponential random variables. We collect basic properties and constructions of the order, some of which belong to the…

Probability · Mathematics 2023-09-28 Alexander Gnedin

We develop foundations for oriented category theory, an extension of $(\infty,\infty)$-category theory obtained by systematic usage of the Gray tensor product, in order to study lax phenomena in higher category theory. As categorical…

Algebraic Topology · Mathematics 2025-10-14 David Gepner , Hadrian Heine

Given an algebraic differential equation of order greater than one, it is shown that if there is any nontrivial algebraic relation amongst any number of distinct nonalgebraic solutions, along with their derivatives, then there is already…

Algebraic Geometry · Mathematics 2022-11-23 James Freitag , Rémi Jaoui , Rahim Moosa

We show that for every countable group, any sequence of approximate homomorphisms with values in permutations can be realized as the restriction of a sofic approximation of an orbit equivalence relation. Moreover, this orbit equivalence…

Group Theory · Mathematics 2024-11-20 Ben Hayes , Srivatsav Kunnawalkam Elayavalli
‹ Prev 1 8 9 10 Next ›