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,657 papers · 148 categories

Trend · papers per month

155310465620 · Jun 202019922001200920172026
48 results for centered fixed effects

CoCP optimizes prediction intervals by jointly learning center and radius, improving efficiency and coverage.

problem Inefficient conformal prediction intervals under heteroscedasticity and skewness.
method Co-optimization framework that learns center and radius through alternating optimization steps.
result CoCP yields consistently shorter intervals and state-of-the-art conditional coverage diagnostics.

The paper explores uniform perfectness and centers in Morse boundaries.

problem Detecting κκ-center exhaustivity in uniformly perfect Morse boundaries.
method Analyzes CAT(0) and geodesic spaces, using visual boundary data and metric transforms.
result Fixed-basepoint uniform perfectness is insufficient for κκ-center exhaustivity.

The paper discusses fairness in bank stress tests, comparing various methods to address institutional differences.

problem Fair aggregation of bank-specific stress test models into a common model.
method Comparing various notions of regression fairness, including estimating and discarding centered bank fixed effects.
result The method of estimating and discarding centered bank fixed effects is preferable for linear models, improving forecast accuracy and equal treatment.

We study the fixed point set in the ideal boundary of a parabolic isometry of a proper CAT(0)-space. We show that the radius of the fixed point set is at most pi/2, and study its centers. As a consequence, we prove that the set of fixed points is contractible with respect to the Tits topology.

2004-08-25abs ↗pdf ↗

MDCN improves treatment effect estimation in multicenter observational studies.

problem Incongruities in multicenter observational studies due to center-specific protocols and treatment reactions.
method MDCN learns a new feature embedding to address selection bias and strengthen information sharing between similar centers.
result MDCN provides more accurate treatment insights for new, unobserved centers compared to existing methods.

Study evaluates the impact of academic support center's face-to-face assistance on student performance.

problem Underestimation of Academic Support Center's true impact due to group bias.
method Applied causal inference theory and T-learner to evaluate conditional average treatment effect (CATE) of F2F personal assistance.
result Developed a new CATE function that depends on the number of F2F sessions, predicting improved CATE performance.

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 ↗

New distributed clustering algorithms show resilience to initialization issues.

problem Resilience of distributed gradient-based clustering algorithms to center initialization.
method Distributed gradient-based clustering algorithms with novel center initialization.
result The algorithms are more resilient to initialization compared to baseline methods.

New features for quantum calculations learn N-center Hamiltonian matrix elements.

problem Quantum calculations need features for N-center Hamiltonians, not just atom-centered ones.
method Developed fully equivariant N-center features for machine learning.
result Learned matrix elements of N-center Hamiltonians efficiently.

Let QI(R)QI(\mathbb{R}) denote the group of all quasi-isometries f:RR.f:\mathbb{R}\to \mathbb{R}. Let Q+(and Q)Q_+( \text{and}~ Q_-) denote the subgroup of QI(R)QI(\mathbb{R}) consisting of elements which are identity near -\infty (resp. ++\infty). We denote by QI+(R)QI^+(\mathbb R) the index 22 subgroup of QI(R)QI(\mathbb R) that fixes …

2018-07-26abs ↗pdf ↗

With the inflation of the data, clustering analysis, as a branch of unsupervised learning, lacks unified understanding and application of its mathematical law. Based on the view of fixed point, this paper restates the model-based clustering and proposes a unified clustering framework. In order to find fixed points as c…

2020-02-19abs ↗pdf ↗

Study sharp upper bounds for Aharonov-Bohm eigenvalues on surfaces.

problem Finding sharp upper bounds for eigenvalues of magnetic Laplacian.
method Isoperimetric inequalities and bounds in terms of Gaussian curvature.
result Maximal first eigenvalue for geodesic disk on simply connected surfaces.

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 ↗

Unified theory linking atom-centered and message-passing models for molecular properties.

problem Combining atom-centered and message-passing models for accurate molecular property prediction.
method Generalizing ACDC framework to include multi-centered information, providing a complete linear basis for regression.
result Unified understanding of atom-centered and message-passing models, providing a coherent foundation.

This paper is concerned with fixed-point free S1S^1-actions (smooth or locally linear) on orientable 4-manifolds. We show that the fundamental group plays a predominant role in the equivariant classification of such 4-manifolds. In particular, it is shown that for any finitely presented group with infinite center, ther…

2013-03-04abs ↗pdf ↗

Valuable training data is often owned by independent organizations and located in multiple data centers. Most deep learning approaches require to centralize the multi-datacenter data for performance purpose. In practice, however, it is often infeasible to transfer all data to a centralized data center due to not only b…

2018-10-16abs ↗pdf ↗

Offline k-means clustering was studied extensively, and algorithms with a constant approximation are available. However, online clustering is still uncharted. New factors come into play: the ordering of the dataset and whether the number of points, n, is known in advance or not. Their exact effects are unknown. In this…

2019-08-09abs ↗pdf ↗

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 DR-ME test for interpretable distributional treatment effects.

problem Detects invisible differences in treatment effects on distributional outcomes.
method Semiparametrically efficient finite-location test using kernel witnesses and orthogonal features.
result DR-ME reveals causal-discrepancy coordinates and has noncentral chi-square local power.

One key use of k-means clustering is to identify cluster prototypes which can serve as representative points for a dataset. However, a drawback of using k-means cluster centers as representative points is that such points distort the distribution of the underlying data. This can be highly disadvantageous in problems wh…

2019-11-14abs ↗pdf ↗

Recently, Awasthi et al. introduced an SDP relaxation of the kk-means problem in Rm\mathbb R^m. In this work, we consider a random model for the data points in which kk balls of unit radius are deterministically distributed throughout Rm\mathbb R^m, and then in each ball, nn points are drawn according to a common ro…

2015-05-18abs ↗pdf ↗

The oloid is the convex hull of two circles with equal radius in perpendicular planes so that the center of each circle lies on the other circle. We calculate the mean width of the oloid in two ways, first via the integral of mean curvature, and then directly. Using this result, the surface area and the volume of the p…

2016-04-25abs ↗pdf ↗

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.

New method for better initial centers in clustering with improved accuracy and privacy.

problem Improving the quality of clustering centers in metric spaces.
method HST initialization based on metric embedding tree structure, combined with efficient search algorithm and DP extension.
result HST initialization produces better initial centers than kk-median++ with comparable efficiency and improved privacy.

We prove that, among the polygons in a punctured disc with fixed angles, the perimeter is minimized by the polygon with an inscribed horocycle centered at the puncture. We generalize this to a disc with a cone point and to an annulus with a geodesic boundary component and a complete end. Then we apply this result to de…

2016-09-27abs ↗pdf ↗

We study a parsimonious but non-trivial model of the latent limit order book where orders get placed with a fixed displacement from a center price process, i.e.\ some process in-between best bid and best ask, and get executed whenever this center price reaches their level. This mechanism corresponds to the fundamental …

2017-01-04abs ↗pdf ↗

A simple Ising spin model which can describe the mechanism of advertising in a duopoly market is proposed. In contrast to other agent-based models, the influence does not flow inward from the surrounding neighbors to the center site, but spreads outward from the center to the neighbors. The model thus describes the spr…

2002-11-04abs ↗pdf ↗

ClovaCall introduces a new Korean call speech corpus for contact centers.

problem Lack of large-scale call-based speech corpora for Korean dialog scenarios.
method Development of a new large-scale Korean call-based speech corpus (ClovaCall) in a restaurant reservation domain.
result Validation of the dataset with ASR models shows its effectiveness.

Let PP be a principal U(1)-bundle over a closed manifold MM. On PP, one can define a modified version of the Ricci flow called the Ricci Yang-Mills flow, due to these equations being a coupling of Ricci flow and the Yang-Mills heat flow. We use maximal regularity theory and ideas of Simonett concerning the asymptoti…

2008-12-10abs ↗pdf ↗

The paper develops a method for self-normalized inference in adaptive experiments.

problem Adaptive experiments require a fixed horizon for ATE estimation, but propensities can change.
method The method uses self-normalized martingale limit theory to estimate ATE.
result The Studentized statistic is asymptotically N(0,1) at the prespecified horizon.

Time dilation 11v2\frac{1}{\sqrt{1-v^2}} and relative velocity vv are observationally indistinguishable in the special theory of relativity, a duality that carries over into the general theory under Fermi coordinates along a curve (in coordinate-independent language, in the tangent Minkowski space along the curve). For …

2005-12-05abs ↗pdf ↗

Study finds cherry-picking load shaping strategies outperforms others in reducing grid CO2 emissions.

problem Lack of detailed counterfactual data makes it hard to assess load shaping strategies' effectiveness.
method Calibrated granular ERCOT simulations for counterfactual analysis of load shaping strategies.
result LMP-based load shaping outperforms other strategies in reducing grid CO2 emissions.