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

55109164218 · Jun 202019922001200920172026
48 results for global view

Proposes a novel model for healthcare and SME credit risk prediction.

problem Lack of guidance from global view in sequence representation learning for time series modeling.
method Hierarchical Global View-guided (HGV) sequence representation learning framework with GGE and ββ-Attn modules.
result Competitive prediction performance compared with other known baselines.

Paper proposes a new method for joint feature selection and graph learning.

problem Previous methods suffer from neglecting joint formulation and lack of graph learning.
method Formulates multi-view feature selection with orthogonal decomposition, incorporates cross-space locality preservation, and uses a unified objective function for simultaneous learning.
result Demonstrates superior performance in multi-view feature selection and graph learning tasks.

In this paper we provide a \emph{global} investigation of the geometry of parallelizable manifolds (or absolute parallelism geometry) frequently used for application. We discuss the different linear connections and curvature tensors from a global point of view. We give an existence and uniqueness theorem for a remarkab…

2012-09-06abs ↗pdf ↗

Proposes a new method for joint sample and feature selection in multi-view data.

problem Cannot detect latent subsets of samples and remove outliers.
method Weighted Sparse Partial Least Squares (/0\ell_\infty/\ell_0-wsPLS) method for joint sample and feature selection.
result Developed globally convergent algorithm and iterative algorithms for multi-view data fusion.

A novel method integrates feature and topology views for unsupervised graph representation learning.

problem Lack of mutual information across feature and topology views in graph representation learning.
method Proposes a multi-view representation learning module and a common representation learning module using mutual information maximization and reconstruction loss minimization.
result Demonstrates effectiveness in integrating feature and topology views, achieving comparable or better performance than supervised methods.

Real-world data sets often provide multiple types of information about the same set of entities. This data is well represented by multi-view graphs, which consist of several distinct sets of edges over the same nodes. These can be used to analyze how entities interact from different viewpoints. Combining multiple views…

2018-08-20abs ↗pdf ↗

Real data are often with multiple modalities or from multiple heterogeneous sources, thus forming so-called multi-view data, which receives more and more attentions in machine learning. Multi-view clustering (MVC) becomes its important paradigm. In real-world applications, some views often suffer from instances missing…

2019-03-02abs ↗pdf ↗

Global fixed income returns span across multiple maturities and economies, that is, they naturally reside on multi-dimensional data structures referred to as tensors. In contrast to standard "flat-view" multivariate models that are agnostic to data structure and only describe linear pairwise relationships, we introduce…

2019-08-06abs ↗pdf ↗

We study the problem of learning to rank from multiple information sources. Though multi-view learning and learning to rank have been studied extensively leading to a wide range of applications, multi-view learning to rank as a synergy of both topics has received little attention. The aim of the paper is to propose a c…

2018-01-31abs ↗pdf ↗

Euler's elastica with monotone curvature is uniquely minimal.

problem Global minimality of planar elastica with monotone curvature.
method Proof of global minimality using clamped boundary conditions and length penalization.
result Every planar elastica with non-constant monotone curvature is uniquely minimal.

We study the capillarity equation from the global point of view of behavior of its solutions without explicit regard to boundary conditions. We show its solutions to be constrained in ways, that have till now not been characterized in literature known to us.

2016-03-23abs ↗pdf ↗

CREIMBO models diverse brain activity by identifying hidden neural sub-circuits and their non-stationary interactions.

problem Lack of alignment in neural recordings limits analysis of brain-wide dynamics.
method CREIMBO learns a unified model of neural dynamics by assuming multiple hidden global sub-circuits representing ensemble interactions.
result CREIMBO discovers session-specific neural ensembles and their non-stationary interactions, revealing cross-subject neural mechanisms.

Bayesian optimization has recently emerged as a popular method for the sample-efficient optimization of expensive black-box functions. However, the application to high-dimensional problems with several thousand observations remains challenging, and on difficult problems Bayesian optimization is often not competitive wi…

2019-10-03abs ↗pdf ↗

Study proves existence of global solutions for Standard Model on expanding spacetimes.

problem Existence of global solutions for the Standard Model on expanding spacetimes.
method Gauge-invariant energy estimate for the Euler-Lagrange equations.
result Existence of global solutions for the Standard Model under specific conditions.

LDLE embeds manifolds in lower dimensions with low distortion.

problem Embedding manifolds in lower dimensions with low distortion.
method Constructs local views using global eigenvectors of the graph Laplacian, registers them using Procrustes analysis, and tears manifolds apart for intrinsic dimension embedding.
result LDLE preserves distances up to a constant scale with low distortion.

We introduce a canonical outer vector field on a Poisson manifold, also due independently to A. Weinstein. We view it as a global section of the sheaf of Poisson vector fields modulo the subsheaf of hamiltonian vector fields. We study this outer derivation mostly in the case of holomorphic Poisson manifolds.

1998-02-03abs ↗pdf ↗

In this paper, a type of integrable evolution equation--the generalized Landau-Lifshitz equation into SnS^n is considered. We deal with this equation from a geometric point of view by rewriting it in a geometric form. Through the geometric energy method, we show the global well-posedness of the corresponding Cauchy pro…

2010-09-13abs ↗pdf ↗

Person re-identification (re-id), an emerging problem in visual surveillance, deals with maintaining entities of individuals whilst they traverse various locations surveilled by a camera network. From a visual perspective re-id is challenging due to significant changes in visual appearance of individuals in cameras wit…

2014-06-13abs ↗pdf ↗

The study explores globally defined eigenfamilies on closed manifolds, providing existence and orthogonality results.

problem Existence and properties of globally defined eigenfamilies on closed Riemannian manifolds.
method Analyzes topological properties, provides non-/existence results, and uses combinatorial identities.
result Highly rigid orthogonality relations for eigenfunction powers in L2(M)L^2(M).

TopoGeoScore selects robust checkpoints using only source-domain representations.

problem Selecting robust checkpoints without target-domain labels or samples.
method Constructs class-conditional mutual k-nearest-neighbour graphs and extracts three interpretable signals.
result Source representations contain measurable global-local-topological evidence of robustness.

Generalized canonical correlation analysis (GCCA) aims at finding latent low-dimensional common structure from multiple views (feature vectors in different domains) of the same entities. Unlike principal component analysis (PCA) that handles a single view, (G)CCA is able to integrate information from different feature …

2016-05-31abs ↗pdf ↗

Improves Bayesian optimisation for engineering design problems with many variables.

problem Efficiently searching for global minima in high-dimensional design spaces.
method Integrates input and output data to identify a reduced latent subspace using probabilistic partial least squares.
result Significant improvements in convergence to the global minimum compared to existing methods.

This thesis attempts to contribute to the study of differentiable dynamics both from a semi-local and global point of view. The center of study is differentiable dynamics in manifolds of dimension 3 where we are interested in the understanding of the existence and structure of attractors as well as dynamical and topolo…

2012-07-07abs ↗pdf ↗

In an earlier work we identified the types and numbers of static equilibrium points of solids arising from fine, equidistant nn-discretrizations of smooth, convex surfaces. We showed that such discretizations carry equilibrium points on two scales: the local scale corresponds to the discretization, the global scale to…

2014-10-20abs ↗pdf ↗

Global Memory Augmentation (GMAT) improves Transformer performance on long documents.

problem Large memory requirements of Transformer pairwise dot-product attention for long sequences.
method Integrates a dense global memory of length M into sparse Transformer blocks.
result Significant improvement on various tasks, including synthetic tasks, masked language modeling, and reading comprehension.

In this note we prove a global rigidity result for asymptotically flat, scalar flat Euclidean hypersurfaces with a minimal horizon lying in a hyperplane, under a natural ellipticity condition. As a consequence we obtain, in the context of the Riemannian Penrose conjecture, a local rigidity result for the family of exte…

2012-05-05abs ↗pdf ↗

The paper addresses rigid alignment of noisy patches, providing a polynomial time algorithm and convergence conditions.

problem Finding a rigid alignment of overlapping local views (patches) that minimizes alignment error in a noisy setting.
method Characterizes non-degeneracy based on kernel and positivity of a matrix, provides polynomial time algorithm for testing non-degeneracy, and uses Riemannian gradient descent for alignment.
result The algorithm converges locally linearly to a non-degenerate perfect alignment under certain conditions.

Motivated by our attempt to recast Cartan's work on Lie pseudogroups in a more global and modern language, we are brought back to the question of understanding the linearization of multiplicative forms on groupoids and the corresponding integrability problem. From this point of view, the novelty of this paper is that w…

2012-10-08abs ↗pdf ↗

We propose an SDP relaxation for the Gromov-Wasserstein distance, providing globally optimal solutions.

problem Matching objects between incomparable spaces using the Gromov-Wasserstein distance.
method Semi-definite programming (SDP) relaxation of the GW distance.
result The SDP relaxation provides globally optimal solutions for the GW distance in some instances.