arXiv research

The study explores continuous noncrossing partitions and their relation to weighted circular factorizations.

There are two natural simplicial complexes associated to the noncrossing partition lattice: the order complex of the full lattice and the order complex of the lattice with its bounding elements removed. The latter is a complex that we call the noncrossing partition link because it is the link of an edge in the former. …

An element in Artin's braid group $B_n$ is called periodic if it has a power which lies in the center of $B_n$. The conjugacy problem for periodic braids can be reduced to the following: given a divisor $1\le d<n-1$ of $n-1$ and an element $α$ in the super summit set of $ε^d$, find $γ\in B_n$ such that $γ^{-1}αγ=ε^d$, …

Proof of $K(π, 1)$ conjecture for affine Artin groups.

A meander of order n is a simple closed curve in the plane which intersects a horizontal line transversely at 2n points. (Meanders which differ by an isotopy of the line and plane are considered equivalent.) Let Gamma_n be the Cayley graph of the symmetric group S_n as generated by all (n choose 2) transpositions. Let …

Ordinal data are often seen in real applications. Regular multicategory classification methods are not designed for this data type and a more proper treatment is needed. We consider a framework of ordinal classification which pools the results from binary classifiers together. An inherent difficulty of this framework i…

We prove the $K(π,1)$ conjecture for affine Artin groups: the complexified complement of an affine reflection arrangement is a classifying space. This is a long-standing problem, due to Arnol'd, Pham, and Thom. Our proof is based on recent advancements in the theory of dual Coxeter and Artin groups, as well as on sever…

Extended dual Coxeter and Artin groups theory to rank-three systems.

Triangulates permutahedra for Coxeter groups, revealing braid group connections.

New geometric object for polynomials simplifies complex data.

The paper proves conditions for the isomorphism between standard and dual Artin groups.

Affine Artin groups have a finite classifying space.

This paper finds a unique partition of a sample space for estimating continuous distributions.

Resurgent analysis reveals full partition function for 3-manifold invariants.

Partition Tree estimates conditional densities for mixed continuous and categorical variables.

In this paper we discuss a natural extension of infinite discrete partition-of-unity copulas which were recently introduced in the literature to continuous partition of copulas with possible applications in risk management and other fields. We present a general simple algorithm to generate such copulas on the basis of …

The paper shows how to approximate continuous maps to smooth CW complexes.

InfoCNF improves conditional image generation by optimizing latent code partitioning and solver error tolerances.

This research designs a data-driven partition to test independence between continuous variables.

Although consistency is a minimum requirement of any estimator, little is known about consistency of the mean partition approach in consensus clustering. This contribution studies the asymptotic behavior of mean partitions. We show that under normal assumptions, the mean partition approach is consistent and asymptotic …

Algorithm learns diffusion processes with high-dimensional state spaces.

This research tackles imbalanced continual learning with a new sampling strategy.

The output scores of a neural network classifier are converted to probabilities via normalizing over the scores of all competing categories. Computing this partition function, $Z$, is then linear in the number of categories, which is problematic as real-world problem sets continue to grow in categorical types, such as …

We construct a cut-off version of nonpertubative closed Bosonic string field theory in the light-cone gauge with imaginary string coupling constant. We show that the partition function is a continuous function of the string coupling constant, and conjecture a relation between the formal power series expansion of this p…

Clustering is an essential technique for discovering patterns in data. The steady increase in amount and complexity of data over the years led to improvements and development of new clustering algorithms. However, algorithms that can cluster data with mixed variable types (continuous and categorical) remain limited, de…

The Mondrian process represents an elegant and powerful approach for space partition modelling. However, as it restricts the partitions to be axis-aligned, its modelling flexibility is limited. In this work, we propose a self-consistent Binary Space Partitioning (BSP)-Tree process to generalize the Mondrian process. Th…

Paper improves classification rates for private data.

Proves simplicity of Lyapunov exponents for specific Anosov flows.

In a series of recent works, we have generalised the consistency results in the stochastic block model literature to the case of uniform and non-uniform hypergraphs. The present paper continues the same line of study, where we focus on partitioning weighted uniform hypergraphs---a problem often encountered in computer …

Given $iid$ observations from an unknown absolute continuous distribution defined on some domain $Ω$, we propose a nonparametric method to learn a piecewise constant function to approximate the underlying probability density function. Our density estimate is a piecewise constant function defined on a binary partition o…

Paper proposes a new method to learn EBMs and their partition function.

This paper presents a new approach for Gaussian process (GP) regression for large datasets. The approach involves partitioning the regression input domain into multiple local regions with a different local GP model fitted in each region. Unlike existing local partitioned GP approaches, we introduce a technique for patc…

BN refines local partition geometry in piecewise-affine networks during training.

The paper studies geometric structures of polynomial spaces.

New MCMC method tackles label-switching problem for clustering.

We present an efficient algorithm for model-free episodic reinforcement learning on large (potentially continuous) state-action spaces. Our algorithm is based on a novel $Q$-learning policy with adaptive data-driven discretization. The central idea is to maintain a finer partition of the state-action space in regions w…

Finding the reduced-dimensional structure is critical to understanding complex networks. Existing approaches such as spectral clustering are applicable only when the full network is explicitly observed. In this paper, we focus on the online factorization and partition of implicit large-scale networks based on observati…

We formulate a supervised learning problem, referred to as continuous ranking, where a continuous real-valued label Y is assigned to an observable r.v. X taking its values in a feature space $\mathcal{X}$ and the goal is to order all possible observations x in $\mathcal{X}$ by means of a scoring function $s:\mathcal{X}…

We present DCSVM, an efficient algorithm for multi-class classification using Support Vector Machines. DCSVM is a divide and conquer algorithm which relies on data sparsity in high dimensional space and performs a smart partitioning of the whole training data set into disjoint subsets that are easily separable. A singl…

MPF method improves parameter estimation in probabilistic models.

Flow based models such as Real NVP are an extremely powerful approach to density estimation. However, existing flow based models are restricted to transforming continuous densities over a continuous input space into similarly continuous distributions over continuous latent variables. This makes them poorly suited for m…

SPACE algorithm prevents forgetting in neural networks by partitioning learned knowledge.

New framework tackles submodular welfare with multi-agent combinatorial bandits.

Variational inference (VI) has become the method of choice for fitting many modern probabilistic models. However, practitioners are faced with a fragmented literature that offers a bewildering array of algorithmic options. First, the variational family. Second, the granularity of the updates e.g. whether the updates ar…

Method discovers local independence in systems with continuous variables.

Single-head attention approximates any function under various norms.

RIPE is a novel deterministic and easily understandable prediction algorithm developed for continuous and discrete ordered data. It infers a model, from a sample, to predict and to explain a real variable $Y$ given an input variable $X \in \mathcal X$ (features). The algorithm extracts a sparse set of hyperrectangles $…

This paper proves properties of uniformly hyperbolic sets and constructs Markov partitions.