Research
On-device research index

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.

168,742 papers · 148 categories

Trend · papers per month

53106158211 · May 202619922001200920172026
48 results for centering operation

Racks and quandles are rich algebraic structures that are strong enough to classify knots. Here we develop several fundamental categorical aspects of the theories of racks and quandles and their relation to the theory of permutations. In particular, we compute the centers of the categories and describe power operations…

2016-09-27abs ↗pdf ↗

Study of qq-rationals and their geometric properties, including deformed Farey triangulation and Springborn operations.

problem Geometry of qq-rationals and their properties.
method Construction and analysis of deformed Farey triangulation and deformed modular surface; definition and study of Springborn operations.
result Derivation of a formula for the qq-deformed midpoint and new qq-deformation of Markov numbers.

A new method improves graph-based learning for high-dimensional data.

problem Inconsistent high-dimensional learning efficiency of semi-supervised graph regularization.
method Introducing a novel regularization approach involving centering operation.
result Empirical results show improved performance over spectral clustering.

Continued reliance on human operators for managing data centers is a major impediment for them from ever reaching extreme dimensions. Large computer systems in general, and data centers in particular, will ultimately be managed using predictive computational and executable models obtained through data-science tools, an…

2015-05-19abs ↗pdf ↗

This study approximates distances between Gaussian processes and covariance operators using RKHS.

problem Approximating distances between Gaussian processes and covariance operators from finite samples.
method Using reproducing kernel Hilbert space (RKHS) covariance and cross-covariance operators, the study shows how to consistently and efficiently estimate Sinkhorn divergence from finite samples.
result Convergence rates are dimension-independent and of the same order as Hilbert-Schmidt distance.

Paper tackles noisy comparison oracle for robust clustering algorithms.

problem Finding robust clustering algorithms under noisy comparison oracle.
method Develops algorithms for k-center clustering and agglomerative hierarchical clustering using noisy comparison oracle.
result Proves robust algorithms achieve good approximation guarantees with high probability.

The paper establishes preferred coordinates for AE 3-manifolds, improving ADM center of mass convergence.

problem Establishing preferred coordinates for asymptotically Euclidean 3-manifolds.
method Analyzing regularity of conformal compactifications via elliptic theory.
result Improves Sobolev regularity of conformally compactified AE 3-manifolds.

A centered innovation MA is equivalent to a digamma-link DARMA for bank-asset shares.

problem Predicting bank-asset shares using Bayesian Dirichlet ARMA models.
method Replacing raw additive log-ratio residuals with centered innovations in B--DARMA.
result Centered specification and digamma-link DARMA are predictively equivalent under specified conditions.

Proposes a framework for energy-efficient AIGC workload scheduling in cloud data centers.

problem Challenges of scheduling AIGC workloads for energy efficiency and quality control.
method Joint energy management and coordinated AIGC workload scheduling framework with diffusion model-aided reward shaping.
result Effective learning of scheduling policies under sparse environmental feedback.

Silent abandonment reduces contact center efficiency by 5%-15%.

problem Measuring customer abandonment and patience in text-based contact centers is challenging due to uncertainty.
method Developed methodologies to identify silent-abandonment customers and estimate customer patience using text analysis and queueing models.
result Silent abandonment accounts for 30%-67% of customer abandonments and reduces system efficiency by 5%-15%.

In this paper we show that, for a sub-Laplacian ΔΔ on a 33-dimensional manifold MM, no point interaction centered at a point q0Mq_0\in M exists. When MM is complete w.r.t. the associated sub-Riemannian structure, this means that ΔΔ acting on C0(M{q0})C^\infty_0(M\setminus\{q_0\}) is essentially self-adjoint. A particular …

2019-02-14abs ↗pdf ↗

We study a regularizer which is defined as a parameterized infimum of quadratics, and which we call the box-norm. We show that the k-support norm, a regularizer proposed by [Argyriou et al, 2012] for sparse vector prediction problems, belongs to this family, and the box-norm can be generated as a perturbation of the fo…

2015-12-27abs ↗pdf ↗

Study classifies hypersurfaces in 4D Lorentz-Minkowski space using specific operators.

problem Classifying tubular hypersurfaces in 4D Lorentz-Minkowski space.
method Analysis of Gauss map and linearized operators L1\mathcal{L}_{1} and L2\mathcal{L}_{2}.
result Classifications of hypersurfaces with specific types of Gauss maps.

Center identified in stated skein algebra for quantum traces.

problem Understanding the center of the stated skein algebra.
method Analyzing the algebra as a generalization of Kauffman bracket skein algebra, focusing on the case when the quantum parameter is a root of unity.
result Simple description and dimension calculation of the center over the center module.

The object of our investigation is a point that gives the maximum value of a potential with a strictly decreasing radially symmetric kernel. It defines a center of a body in Rm. When we choose the Riesz kernel or the Poisson kernel as the kernel, such centers are called a radial center or an illuminating center, respec…

2016-03-09abs ↗pdf ↗

Refines geometric center of mass analysis for Einstein field equations.

problem Analyzing the geometric center of mass of Willmore surfaces in initial data for Einstein field equations.
method Refined Lyapunov-Schmidt analysis to study geometric center of mass of area-constrained Willmore surfaces.
result The geometric center of mass agrees with the Hamiltonian center of mass under specific conditions.

The article improves Beckner's inequality for axially symmetric functions on the n-dimensional sphere.

problem Improving Beckner's inequality for axially symmetric functions on Sn\mathbb{S}^n.
method Uniqueness and existence results for Q-curvature type equations with a Paneitz operator on Sn\mathbb{S}^n for axially symmetric functions.
result Improved Beckner's inequality for axially symmetric functions on Sn\mathbb{S}^n.

This work builds a sensor graph from DC sensors for anomaly detection.

problem Anomaly detection in data centers with complex sensor relationships.
method Data-driven pipeline (ts2graph) to build a sensor graph from sensor time series.
result Graph neural network (GNN) outperforms existing methods by 2-3 times in anomaly detection.

Let f:M->M be a partially hyperbolic diffeomorphism such that all of its center leaves are compact. We prove that Sullivan's example of a circle foliation that has arbitrary long leaves cannot be the center foliation of f. This is proved by thorough study of the accessible boundaries of the center-stable and the center…

2011-04-28abs ↗pdf ↗

We investigate centers of a body (the closure of a bounded open set) defined as maximum points of potentials. In particular, we study centers defined by the Riesz potential and by Poisson's integral. These centers, in general, depend on parameters and move with respect to the parameters. We give a necessary and suffici…

2016-03-28abs ↗pdf ↗

The paper analyzes MACD using operator theory.

problem Understanding the mathematical foundation of MACD.
method Developed a functional-analytic framework interpreting MACD as a phase-corrected, smoothed derivative operator.
result MACD is structurally equivalent to a band-pass filter and can be expressed as a finite difference of delayed and doubly averaged signals.

New positive mass theorem for hyperbolic 3-manifolds using Green functions.

problem Proving a positive mass theorem for asymptotically hyperbolic 3-manifolds.
method Using a monotonicity formula for the Green function of the Laplace operator.
result Established a new positive mass theorem for three-dimensional manifolds.

In this paper we extend to the difference case the notion of Poisson-Lichnerowicz cohomology, an object encapsulating the building blocks for the theory of deformations of Hamiltonian operators. A local scalar difference Hamiltonian operator is a polynomial in the shift operator and its inverse, with coefficients in th…

2018-10-19abs ↗pdf ↗

We prove the existence of a center, or continuous selection of a point, in the relative interior of C1C^1 embedded kk-disks in Riemannian nn-manifolds. If k3k\le 3 the center can be made equivariant with respect to the isometries of the manifold, and under mild assumptions the same holds for k=4=nk=4=n. By contrast, for…

2017-06-25abs ↗pdf ↗

This work analyzes centered binary Restricted Boltzmann Machines (RBMs) and binary Deep Boltzmann Machines (DBMs), where centering is done by subtracting offset values from visible and hidden variables. We show analytically that (i) centering results in a different but equivalent parameterization for artificial neural …

2013-11-06abs ↗pdf ↗

The paper quantizes concatenated noisy vectors to a common cluster center, improving performance over naive methods.

problem Clustering concatenated noisy vectors from multiple sources.
method Asymptotic analysis of weighted sum of distances to a common cluster center.
result The clustering approach outperforms naive methods in terms of average distortion.

We construct a series of finitely presented semigroups. The centers of these semigroups encode uniquely up to rigid ambient isotopy in 3-space all non-oriented spatial graphs. This encoding is obtained by using three-page embeddings of graphs into the product of the line with the cone on three points. By exploiting thr…

2004-07-19abs ↗pdf ↗

In this study, we investigate the locus of the centers of the Meusnier spheres. Just as focal curve is the locus of the centers of the osculating spheres, we investigate the geometrical interpretation on the locus of the centers of the Meusnier spheres. We proved that if the curve is a principal line, the locus of the …

2013-07-16abs ↗pdf ↗

This article briefly introduced Arthur and Vassilvitshii's work on \textbf{k-means++} algorithm and further generalized the center initialization process. It is found that choosing the most distant sample point from the nearest center as new center can mostly have the same effect as the center initialization process in…

2019-03-24abs ↗pdf ↗

The determination of cluster centers generally depends on the scale that we use to analyze the data to be clustered. Inappropriate scale usually leads to unreasonable cluster centers and thus unreasonable results. In this study, we first consider the similarity of elements in the data as the connectivity of nodes in an…

2016-10-19abs ↗pdf ↗

Absolutely partially hyperbolic surface endomorphisms have a coherent center foliation.

problem Understanding the dynamics of absolutely partially hyperbolic surface endomorphisms.
method Showed the existence of a center foliation and leaf conjugacy to the linearization.
result Absolutely partially hyperbolic surface endomorphisms have a dynamically coherent center foliation.

Paper introduces a method for operator learning using random features.

problem Estimating maps between infinite-dimensional spaces using input-output pairs.
method Function-valued random features method, building a linear combination of random operators.
result The method provides convergence guarantees and error bounds for nonlinear problems.