arXiv research

Study of hill-climbing clustering methods and their consistency.

Hill-ADAM optimizes loss landscapes by exploring state space deterministically.

We prove the existence of a new class of constant mean curvature cylinders with an arbitrary number of umbilics by unitarizing the monodromy of Hill's equation.

Combines k-means and hill climbing for stratification and allocation.

Hill-climbing is a powerful baseline for NAS, even with reduced noise.

New proof shows how to identify DAGs with weakly increasing errors.

Let $φ:G \to G$ be a group endomorphism where $G$ is a finitely generated group of exponential growth, and denote by $R(φ)$ the number of twisted $φ$-conjugacy classes. Fel'shtyn and Hill \cite{fel-hill} conjectured that if $φ$ is injective, then $R(φ)$ is infinite. This conjecture is true for automorphisms of non-elem…

Study efficient graph optimization with noisy data.

The paper analyzes ESS metrics and their connections to entropy families.

Good predictors of ICU Mortality have the potential to identify high-risk patients earlier, improve ICU resource allocation, or create more accurate population-level risk models. Machine learning practitioners typically make choices about how to represent features in a particular model, but these choices are seldom eva…

The paper examines various RL algorithms to address overestimation and noise issues.

Dyna is an architecture for model-based reinforcement learning (RL), where simulated experience from a model is used to update policies or value functions. A key component of Dyna is search-control, the mechanism to generate the state and action from which the agent queries the model, which remains largely unexplored. …

Study applies inverse scattering to BKM systems, linking spectra and integrable systems.

The paper explores projective structures on curves and their applications in conformal geometry.

Framework for multi-agent RL with human feedback in a Snake game.

The Jacobi-Maupertuis metric allows one to reformulate Newton's equations as geodesic equations for a Riemannian metric which degenerates at the Hill boundary. We prove that a JM geodesic which comes sufficiently close to a regular point of the boundary contains pairs of conjugate points close to the boundary. We prove…

A graph clustering method that moves nodes to highest-degree neighbors.

In this paper we propose a new approach to estimation of the tail exponent in financial stock markets. We begin the study with the finite sample behavior of the Hill estimator under α-stable distributions. Using large Monte Carlo simulations, we show that the Hill estimator overestimates the true tail exponent and can …

New approach for learning large Bayesian networks using feature clustering and compression.

FEDHC learns Bayesian networks efficiently for continuous data.

The purpose of the present paper is to prove for finitely generated groups of type I the following conjecture of A.Fel'shtyn and R.Hill, which is a generalization of the classical Burnside theorem. Let G be a countable discrete group, f one of its automorphisms, R(f) the number of f-conjugacy classes, and S(f)=# Fix (f…

We present a novel hybrid algorithm for Bayesian network structure learning, called Hybrid HPC (H2PC). It first reconstructs the skeleton of a Bayesian network and then performs a Bayesian-scoring greedy hill-climbing search to orient the edges. It is based on a subroutine called HPC, that combines ideas from increment…

In this paper we tackle the problem of estimating the power-law tail exponent of income distributions by using the Hill's estimator. A subsample semi-parametric bootstrap procedure minimising the mean squared error is used to choose the power-law cutoff value optimally. This technique is applied to personal income data…

New methods for constructing null fluid metrics and solving optical lift conjectures.

Louis Poinsot has shown in 1854 that the motion of a rigid body, with one of its points fixed, can be described as the rolling without slipping of one cone, the 'body cone', along another, the 'space cone', with their common vertex at the fixed point. This description has been further refined by the second author in 19…

Consider the problem of sparse clustering, where it is assumed that only a subset of the features are useful for clustering purposes. In the framework of the COSA method of Friedman and Meulman, subsequently improved in the form of the Sparse K-means method of Witten and Tibshirani, a natural and simpler hill-climbing …

We show that an invariant surface allows to construct the Jacobi vector field along a geodesic and construct the formula for the normal component of the Jacobi field. If a geodesic is the transversal intersection of two invariant surfaces (such situation we have, for example, if the geodesic is hyperbolic), then we can…

In this paper, we will provide an introduction to the derivative-free optimization algorithms which can be potentially applied to train deep learning models. Existing deep learning model training is mostly based on the back propagation algorithm, which updates the model variables layers by layers with the gradient desc…

A discrete system's heterogeneity is measured by the Rényi heterogeneity family of indices (also known as Hill numbers or Hannah--Kay indices), whose units are {the numbers equivalent}. Unfortunately, numbers equivalent heterogeneity measures for non-categorical data require {a priori} (A) categorical partitioning and …

Bayesian network framework assesses urban risks across multiple domains.

In this paper, we will provide an introduction to the derivative-free optimization algorithms which can be potentially applied to train deep learning models. Existing deep learning model training is mostly based on the back propagation algorithm, which updates the model variables layers by layers with the gradient desc…

An evolutionary algorithm separates mixed DNA profiles in forensic genetics.

Library learns Bayesian networks from mixed data without discretization.

We introduce a CR-invariant class of Lorentzian metrics on a circle bundle over a 3-dimensional CR-structure, which we call quasi-Fefferman metrics. These metrics generalise the Fefferman metric but allow for more control of the Ricci curvature. Our main result is a criterion for embaddability of 3-dimensional CR-struc…

The restricted planar three-body problem has a rich history, yet many unanswered questions still remain. In the present paper we prove the existence of a global surface of section near the smaller body in a new range of energies and mass ratios for which the Hill's region still has three connected components. The appro…

Probabilistic graphical models are graphical representations of probability distributions. Graphical models have applications in many fields including biology, social sciences, linguistic, neuroscience. In this paper, we propose directed acyclic graphs (DAGs) learning via bootstrap aggregating. The proposed procedure i…

Undirected graphical models known as Markov networks are popular for a wide variety of applications ranging from statistical physics to computational biology. Traditionally, learning of the network structure has been done under the assumption of chordality which ensures that efficient scoring methods can be used. In ge…

Let $M\subset \mathbb{S}^{n+1}\subset\mathbb{R}^{n+2}$ be a compact cmc rotational hypersurface of the $(n+1)$-dimensional Euclidean unit sphere. Denote by $|A|^2$ the square of the norm of the second fundamental form and $J(f)=-Δf-nf-|A|^2f$ the stability or Jacobi operator. In this paper we compute the spectra of the…

QWO speeds up causal discovery in LiGAMs by $O(n^2)$.

Proves existence of manifolds with Kervaire invariant one in specific dimensions.

Skein modules are the main objects of an algebraic topology based on knots (or position). In the same spirit as Leibniz we would call our approach "algebra situs." When looking at the panorama of skein modules we see, past the rolling hills of homologies and homotopies, distant mountains - the Kauffman bracket skein mo…

Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algorithm to learn the chordal structure of a probabilistic model from data. The algorithm is a greedy hill-climbing search algorithm that uses t…

New algorithm speeds up learning of graphical models.

The study lifts certain Sasakian manifolds to quasi-Einstein spacetimes.

Bayesian additive regression trees (BART) (Chipman et. al., 2010) is a powerful predictive model that often outperforms alternative models at out-of-sample prediction. BART is especially well-suited to settings with unstructured predictor variables and substantial sources of unmeasured variation as is typical in the so…

In this paper we obtain generalized Calabi-type compactness criteria for complete Riemannian manifolds that allow the presence of negative amounts of Ricci curvature. These, in turn, can be rephrased as new conditions for the positivity, for the existence of a first zero and for the nonoscillatory-oscillatory behaviour…

We present a novel hybrid algorithm for Bayesian network structure learning, called H2PC. It first reconstructs the skeleton of a Bayesian network and then performs a Bayesian-scoring greedy hill-climbing search to orient the edges. The algorithm is based on divide-and-conquer constraint-based subroutines to learn the …

We present new algorithms for learning Bayesian networks from data with missing values using a data augmentation approach. An exact Bayesian network learning algorithm is obtained by recasting the problem into a standard Bayesian network learning problem without missing data. To the best of our knowledge, this is the f…