Searcharxiv⌕ Search

arXiv subjects

Ioannis Konstantoulas

Publications and source records attributed to Ioannis Konstantoulas.

5 recordsLinked to original sources

Auto-Relational Reasoning

Background & Objectives: In the last decade, Machine learning research has grown rapidly, but large models are reaching their soft limits demonstrating diminishing returns and still lack solid reasoning abilities. These limits could be surpassed through synergistic combination of Machine Learning scalability and rigid reasoning. Methods: In this work, we propose a theoretical framework for reasoning through object-relations in an automated manner integrated with Artificial Neural Networks. We present a formal analysis of the Reasoning, and we show the theory in practice through a paradigm integrating Reasoning and Machine Learning. Results: This paradigm is a system that solves Intelligence Quotient problems without any prior knowledge of the problem. Our system achieves 98.03% solving rate corresponding to the top 1% percentile or 132-144 iq score. This result is only limited by the small size of the model and the processing capabilities of the machine it run on. Conclusions: With the integration of prior knowledge in the system and the expansion of the dataset, the system can be generalized to solve a large category of problems. The functionality of the system inherently favors the solution of such problems in few-shot or zero-shot attempts.

cs.AI↗

Zero-one laws for eventually always hitting points in in rapidly mixing systems

In this work we study the set of eventually always hitting points in shrinking target systems. These are points whose long orbit segments eventually hit the corresponding shrinking targets for all future times. We focus our attention on systems where translates of targets exhibit near perfect mutual independence, such as Bernoulli schemes and the Gauss map. For such systems, we present tight conditions on the shrinking rate of the targets so that the set of eventually always hitting points is a null set (or co-null set respectively).

math.DS↗

Discrepancy of general symplectic lattices

We consider random lattices taken from the general symplectic ensemble and count the number of lattice points of a typical lattice in nested families $B_t$ of certain Borel sets. Our main result is that for almost every general symplectic lattice, the discrepancy $D(Λ,B_t)$ of the lattice point count with respect to the volumes is $O(vol(B_t)^{-δ})$. This extends work of W. Schmidt who gave similar discrepancy bounds for the space of all lattices in $\mathbb{R}^n$.

math.NT↗

Lattice deformations in the Heisenberg group

The space of deformations of the integer Heisenberg group under the action of $\textrm{Aut}(H(\mathbb{R}))$ is a homogeneous space for a non-reductive group. We analyze its structure as a measurable dynamical system and obtain mean and variance estimates for Heisenberg lattice point counting in measurable subsets of $\mathbb{R}^3$; in particular, we obtain a random Minkowski-type theorem. Unlike the Euclidean case, we show there are necessary geometric conditions on the sets that satisfy effective variance bounds.

math.NT↗

Effective multiple mixing in semidirect product actions

We prove effective decay of certain multiple correlation coefficients for measure preserving, mixing Weyl chamber actions of semidirect products of semisimple groups with $G$-vector spaces. These estimates provide decay for some semisimple groups of higher rank.

math.DS↗