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

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for global consistency

Develops transparent global models consistent with local explanations.

problem Creating globally interpretable models that align with local explanations from black-box models.
method Custom boolean features from sparse local contrastive explanations are used to train a globally transparent model.
result Custom transparent models have higher local consistency compared to other strategies.

Study shows how discrete graph curvature relates to manifold curvature.

problem Relating discrete graph curvature to intrinsic manifold curvature.
method Continuum limits of Ollivier's Ricci curvature on data clouds.
result Random geometric graphs inherit global curvature properties of manifolds.

The paper revisits and improves on a Bayesian relevance vector machine method for small sample sizes.

problem Statistical modeling with small sample sizes relative to the number of covariates.
method Introduces a new class of global-local priors and provides theoretical properties.
result Results on posterior consistency and contraction rates are provided.

This paper presents foundational theoretical results on distributed parameter estimation for undirected probabilistic graphical models. It introduces a general condition on composite likelihood decompositions of these models which guarantees the global consistency of distributed estimators, provided the local estimator…

2014-06-11abs ↗pdf ↗

ADCMs adaptively discretize CMs for efficient training.

problem Manual discretization schemes cause repeated adjustments for different noise schedules and datasets.
method Unified framework with optimization problem, local and global consistency constraints, and Gauss-Newton method.
result Significantly improve training efficiency and generative performance of CMs.

New method detects inconsistencies in AHP matrices using triadic preference reversals.

problem Challenges in assessing consistency in AHP pairwise comparison matrices.
method Triadic preference reversals to detect inconsistencies between pairs of elements.
result 97% accuracy in detecting inconsistencies, significantly surpassing traditional methods.

Feature maps, that preserve the global topology of arbitrary datasets, can be formed by self-organizing competing agents. So far, it has been presumed that global interaction of agents is necessary for this process. We establish that this is not the case, and that global topology can be uncovered through strictly local…

2019-02-11abs ↗pdf ↗

WassFFed addresses fairness in Federated Learning by ensuring consistency between local and global models.

problem Achieving fairness in Federated Learning where data is distributed among diverse user groups.
method WassFFed employs a Wasserstein barycenter calculation to aggregate local models' outputs, ensuring consistency and fairness.
result WassFFed outperforms existing approaches in balancing accuracy and fairness.

Transferring learned models to novel tasks is a challenging problem, particularly if only very few labeled examples are available. Although this few-shot learning setup has received a lot of attention recently, most proposed methods focus on discriminating novel classes only. Instead, we consider the extended setup of …

2019-07-22abs ↗pdf ↗

We derive high-probability finite-sample uniform rates of consistency for kk-NN regression that are optimal up to logarithmic factors under mild assumptions. We moreover show that kk-NN regression adapts to an unknown lower intrinsic dimension automatically. We then apply the kk-NN regression rates to establish new …

2017-07-19abs ↗pdf ↗

Paper improves short text clustering by integrating semantic relationships into Optimal Transport.

problem Erroneous pseudo-labels caused by neglecting semantic consistency in existing OT methods.
method Designs an instance-level attention mechanism to capture semantic relationships and integrates them into the OT formulation.
result Generates reliable pseudo-labels that improve clustering accuracy.

Let ΣΣ be a connected, oriented surface with punctures and negative Euler characteristic. We introduce regular globally hyperbolic anti-de Sitter structures on Σ×RΣ\times \mathbb{R} and provide two parameterisations of their deformation space: as an enhanced product of two copies of the Fricke space of ΣΣ and as the b…

2018-06-21abs ↗pdf ↗

Generates diverse images by resampling specific parts while maintaining global consistency.

problem Creating diverse images while maintaining global consistency in certain parts.
method Developed a new network architecture, training procedure, and resampling algorithm.
result Achieved low distortion block-resampling with spatially stochastic networks.

TREGO improves EGO for global optimization of high-dimensional problems.

problem Efficient Global Optimization struggles with high dimensions and lacks theoretical guarantees.
method TREGO alternates between EGO steps and local steps within a trust region.
result TREGO outperforms EGO and other methods in black-box optimization problems.

Paper develops NPG for risk-averse RL with ECRMs, proving global convergence.

problem Ensuring reliable performance in stochastic RL problems with risk-averse policies.
method Developed natural policy gradient updates for ECRMs-based RL problems, proving global optimality and iteration complexity.
result Global convergence of risk-averse NPG algorithm with ECRMs.

Study finds conditions for global minimizers on curved manifolds with fast diffusion and nonlocal interactions.

problem Existence of global minimizers for a free energy functional on negatively curved manifolds.
method Investigation of Carlson-Levin type inequalities for Cartan-Hadamard manifolds.
result Establishes necessary and sufficient conditions for the existence of global energy minimizers.

The large-scale organization of the world economies is exhibiting increasingly levels of local heterogeneity and global interdependency. Understanding the relation between local and global features calls for analytical tools able to uncover the global emerging organization of the international trade network. Here we an…

2007-04-10abs ↗pdf ↗

Global models outperform local models in forecasting intermittent time series.

problem Forecasting intermittent time series with zeros in supply chains.
method Comparison of state-of-the-art probabilistic local and global models on five datasets.
result TiDE, a simple neural network architecture, achieves the best accuracy among global models.

This paper is motivated by the non-linear stability problem for the expanding region of Kerr de Sitter cosmologies in the context of Einstein's equations with positive cosmological constant. We show that under dynamically realistic assumptions the conformal Weyl curvature of the spacetime decays towards future null inf…

2016-10-13abs ↗pdf ↗

Rank aggregation systems collect ordinal preferences from individuals to produce a global ranking that represents the social preference. Rank-breaking is a common practice to reduce the computational complexity of learning the global ranking. The individual preferences are broken into pairwise comparisons and applied t…

2016-01-21abs ↗pdf ↗

We consider a Canham-Helfrich-type variational problem defined over closed surfaces enclosing a fixed volume and having fixed surface area. The problem models the shape of multiphase biomembranes. It consists of minimizing the sum of the Canham-Helfrich energy, in which the bending rigidities and spontaneous curvatures…

2012-04-30abs ↗pdf ↗

Many traditional signal recovery approaches can behave well basing on the penalized likelihood. However, they have to meet with the difficulty in the selection of hyperparameters or tuning parameters in the penalties. In this article, we propose a global adaptive generative adjustment (GAGA) algorithm for signal recove…

2019-11-02abs ↗pdf ↗

New algorithm trains deep neural networks without global optimization.

problem Training deep neural networks efficiently and without global optimization.
method Uses random complex exponential activation functions and Markov Chain Monte Carlo sampling.
result Consistently attains theoretical approximation rate for residual networks.

New algorithms improve likelihood of finding global optima in Bayesian inference.

problem Finding global optima in Bayesian inference is difficult due to nonconvexity.
method Developed two algorithms: consistent Laplace approximation (CLA) and consistent stochastic variational inference (CSVI).
result Both CSVI and CLA improve likelihood of obtaining global optima compared to standard methods.

The paper finds curves minimizing elastic energy pinned at endpoints.

problem Finding curves that minimize elastic energy with fixed endpoints.
method Applying the shooting method to identify and classify critical points.
result Critical points consist of wavelike elasticae, and minimizers have no loops or interior inflection points.

The goal of the paper is to design sequential strategies which lead to efficient optimization of an unknown function under the only assumption that it has a finite Lipschitz constant. We first identify sufficient conditions for the consistency of generic sequential algorithms and formulate the expected minimax rate for…

2017-03-07abs ↗pdf ↗

FedReLa: A novel data-level approach for imbalanced federated learning

problem Improving accuracy of federated learning models under class imbalance and data heterogeneity
method Re-labeling samples with a feature-dependent label re-allocator
result Significant improvements in accuracy for minority classes and overall accuracy on stepwise-imbalanced and long-tailed datasets

CCE improves anomaly detection metrics by measuring both confidence and consistency.

problem Existing anomaly detection metrics lack discriminative power, hyperparameter dependency, and robustness to perturbations.
method CCE uses Bayesian estimation to quantify uncertainty and constructs global and event-level confidence and consistency scores.
result CCE demonstrates strict boundedness, robustness, and linear time complexity.

New research shows hyperbolic embeddings are useful for global consistency tasks in graphs.

problem The usefulness of hyperbolic representations in graph learning tasks.
method Computed hyperbolic embeddings for node classification and link prediction tasks, addressing optimization issues at zero curvature.
result Hyperbolic embeddings are more effective for tasks requiring global consistency, while Euclidean models are superior for other tasks.

New method identifies differences between groups in low-dimensional data representations.

problem Identifying meaningful differences between groups in low-dimensional data representations.
method Introduce Global Counterfactual Explanation (GCE) and Transitive Global Translations (TGT) for computing GCEs.
result TGT identifies sparse, accurate explanations that match real data patterns.

The paper examines Nash equilibrium in GANs for stationary Gaussian processes.

problem Existence and uniqueness of Nash equilibrium in GANs for stationary Gaussian processes.
method Analyzes the existence of Nash equilibrium in GANs for stationary Gaussian processes, considering different discriminator families.
result The existence of Nash equilibrium depends on the discriminator family and symmetry properties of the generator family.