BN refines local partition geometry in piecewise-affine networks during training.
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
Survey of mass partition problems in geometry and topology.
Extends partitioned local depth concept with probabilistic considerations.
Locally isoperimetric partitions minimize perimeter in space.
A lens cluster minimizes perimeter in the plane with given area constraints.
New bound on partition function proves Kähler-Einstein stability.
The paper constructs Markov partitions for geodesic flow on hyperbolic surfaces.
Classifies instantons on a specific gravitational instanton and computes partition functions.
MD-split+ creates locally valid prediction regions for complex data.
New framework links fractal complexity to separation dimension.
New stratification reveals intrinsic singularity types of orbit spaces.
We study geometric consistency relations between angles on 3-dimensional (3D) circular quadrilateral lattices -- lattices whose faces are planar quadrilaterals inscribable into a circle. We show that these relations generate canonical transformations of a remarkable ``ultra-local'' Poisson bracket algebra defined on di…
We review the polynomial structure of the topological string partition functions as solutions to the holomorphic anomaly equations. We also explain the connection between the ring of propagators defined from special Kähler geometry and the ring of almost-holomorphic modular forms defined on modular curves.
We show how the smooth geometry of Calabi-Yau manifolds emerges from the thermodynamic limit of the statistical mechanical model of crystal melting defined in our previous paper arXiv:0811.2801. In particular, the thermodynamic partition function of molten crystals is shown to be equal to the classical limit of the par…
Chern-Simons theory on a closed contact three-manifold is studied when the Lie group for gauge transformations is compact, connected and abelian. A rigorous definition of an abelian Chern-Simons partition function is derived using the Faddeev-Popov gauge fixing method. A symplectic abelian Chern-Simons partition functi…
We study the localization of a cluster of activated vertices in a graph, from adaptively designed compressive measurements. We propose a hierarchical partitioning of the graph that groups the activated vertices into few partitions, so that a top-down sensing procedure can identify these partitions, and hence the activa…
Minimal partitions with minimal perimeter found in metric spaces.
Lectures detail field theory dynamics and exact WKB analysis.
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…
Space partitions of underlie a vast and important class of fast nearest neighbor search (NNS) algorithms. Inspired by recent theoretical work on NNS for general metric spaces [Andoni, Naor, Nikolov, Razenshteyn, Waingarten STOC 2018, FOCS 2018], we develop a new framework for building space partitions re…
LA-MCTS learns search space partition for black-box optimization using Monte Carlo Tree Search.
We show that the link invariants derived from 3-dimensional quantum hyperbolic geometry can be defined by means of planar state sums based on link diagrams and a new family of enhanced Yang-Baxteroperators (YBO) that we compute explicitly. By a local comparison of the respective YBO's we show that these invariants coin…
In the wake of recent advances in experimental methods in neuroscience, the ability to record in-vivo neuronal activity from awake animals has become feasible. The availability of such rich and detailed physiological measurements calls for the development of advanced data analysis tools, as commonly used techniques do …
For non-compact manifolds with boundary we prove that bounded geometry defined by coordinate-free curvature bounds is equivalent to bounded geometry defined using bounds on the metric tensor in geodesic coordinates. We produce a nice atlas with subordinate partition of unity on manifolds with boundary of bounded geomet…
Localized transfer learning improves nonparametric regression performance.
Perturbative string amplitudes are correctly derived from the string geometry theory, which is one of the candidates of a non-perturbative formulation of string theory. In order to derive non-perturbative effects rather easily, we formulate topological string geometry theory. We derive the perturbative partition functi…
Traditionally, an artificial neural network (ANN) is trained slowly by a gradient descent algorithm such as the backpropagation algorithm since a large number of hyperparameters of the ANN need to be fine-tuned with many training epochs. To highly speed up training, we created a novel shallow 4-layer ANN called "Pairwi…
We present a new way of constructing an ensemble classifier, named the Guided Random Forest (GRAF) in the sequel. GRAF extends the idea of building oblique decision trees with localized partitioning to obtain a global partitioning. We show that global partitioning bridges the gap between decision trees and boosting alg…
Develops an MS-inspired algorithm for regression mode finding and space partitioning.
A common divide-and-conquer approach for Bayesian computation with big data is to partition the data, perform local inference for each piece separately, and combine the results to obtain a global posterior approximation. While being conceptually and computationally appealing, this method involves the problematic need t…
The paper extends localisation technique to multiple constraints in Euclidean spaces.
Minimal networks minimize length and mass in certain configurations.
Study optimal partitions on spheres using fractional Q-curvature and variational methods.
ParK efficiently solves kernel ridge regression for large datasets.
A novel non-supervised method detects anomalies in multivariate time series.
Hyperkahler quotients by non-free actions are typically highly singular, but are remarkably still partitioned into smooth hyperkahler manifolds. We show that these partitions are topological stratifications, in a strong sense. We also endow the quotients with global Poisson structures which induce the hyperkahler struc…
Recently, locality sensitive hashing (LSH) was shown to be effective for MIPS and several algorithms including -ALSH, Sign-ALSH and Simple-LSH have been proposed. In this paper, we introduce the norm-range partition technique, which partitions the original dataset into sub-datasets containing items with similar 2-…
Region-specific linear models are widely used in practical applications because of their non-linear but highly interpretable model representations. One of the key challenges in their use is non-convexity in simultaneous optimization of regions and region-specific models. This paper proposes novel convex region-specific…
Ehrenborg and Jung recently related the order complex for the lattice of d-divisible partitions with the simplicial complex of pointed ordered set partitions via a homotopy equivalence. The latter has top homology naturally identified as a Specht module. Their work unifies that of Calderbank, Hanlon, Robinson, and Wach…
Definition of the partition function of U(1) gauge theory is extended to a class of four-manifolds containing all compact spaces and certain asymptotically locally flat (ALF) ones including the multi-Taub--NUT spaces. The partition function is calculated via zeta-function regularization with special attention to its mo…
LDP speeds up causal discovery by partitioning, improving VAS recall and runtime.
We present graph partition neural networks (GPNN), an extension of graph neural networks (GNNs) able to handle extremely large graphs. GPNNs alternate between locally propagating information between nodes in small subgraphs and globally propagating information between the subgraphs. To efficiently partition graphs, we …
In this paper, we investigate a divide and conquer approach to Kernel Ridge Regression (KRR). Given n samples, the division step involves separating the points based on some underlying disjoint partition of the input space (possibly via clustering), and then computing a KRR estimate for each partition. The conquering s…
Enhances POU-Nets with probabilistic noise model for efficient spatial data clustering.
Study on optimal partitions and nodal solutions for the Yamabe equation.
Consider a nonparametric contextual multi-arm bandit problem where each arm is associated to a nonparametric reward function mapping from contexts to the expected reward. Suppose that there is a large set of arms, yet there is a simple but unknown structure amongst the arm reward…
For a branched cover between two closed orientable surfaces, the Riemann-Hurwitz formula relates the Euler characteristics of the surfaces, the total degree of the cover, and the total length of the partitions of the degree given by the local degrees at the preimages of the branching points. A very old problem asks whe…
Novel threefold partitioning of -spinor space on cone links.