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

69138207276 · Jun 202019922001200920172026
48 results for visual connectivity

The paper uses deep learning to speed up spatial and visual connectivity analysis.

problem Slow calculation of spatial and visual connectivity metrics.
method Investigates machine learning models and a pipeline for training them on spatial and visual connectivity analysis.
result Deep learning models significantly speed up the analysis process.

Visualizes board connections for socially responsible investing insights.

problem Understanding corporate governance and sustainability through board connections.
method Data Visualization tool to reveal connections between Directors and Executives.
result Strength of tool in investigating corporate governance and sustainability.

A seminal result in geometric group theory is that a 1-ended hyperbolic group has a locally connected visual boundary. As a consequence, a 1-ended hyperbolic group also has a path connected visual boundary. In this paper, we study when this phenomenon occurs for CAT(0) groups. We show if a 1-ended CAT(0) group with iso…

2019-09-26abs ↗pdf ↗

The horoboundary of Teichmüller space is path connected and has non-dense Busemann points.

problem Characterizing the horoboundary of Teichmüller space.
method Using the relationship between the horofunction and visual compactifications of Teichmüller spaces.
result The horoboundary of Teichmüller space is path connected and has non-dense Busemann points.

The visual systems of many mammals, including humans, is able to integrate the geometric information of visual stimuli and to perform cognitive tasks already at the first stages of the cortical processing. This is thought to be the result of a combination of mechanisms, which include feature extraction at single cell l…

2014-07-02abs ↗pdf ↗

In all known examples of a CAT(0) group acting on CAT(0) spaces with non-homeomorphic CAT(0) visual boundaries, the boundaries are each not path connected. In this paper, we show this does not have to be the case by providing examples of right-angled Artin groups which exhibit non-unique CAT(0) boundaries where all of …

2019-10-16abs ↗pdf ↗

The paper explores connections between perimeter, area, and visual angle of convex sets.

problem Understanding geometric properties of convex sets through visual angle and related measurements.
method Establishing universal formulas and characterizing convex sets of constant width.
result Crofton's formula is the unique universal formula relating visual angle, length, and area.

Model explains optical illusions using geometric sub-Riemannian geodesics.

problem Understanding and explaining geometrical optical illusions.
method Neuro-mathematical model based on sub-Riemannian geodesics in the Roto-Translation Group.
result Illusory contours are described as geodesics in a new metric.

The current leading computer vision models are typically feed forward neural models, in which the output of one computational block is passed to the next one sequentially. This is in sharp contrast to the organization of the primate visual cortex, in which feedback and lateral connections are abundant. In this work, we…

2019-10-16abs ↗pdf ↗

Visual relationship detection can bridge the gap between computer vision and natural language for scene understanding of images. Different from pure object recognition tasks, the relation triplets of subject-predicate-object lie on an extreme diversity space, such as \textit{person-behind-person} and \textit{car-behind…

2018-09-11abs ↗pdf ↗

Deep convolutional neural networks (CNNs) have demonstrated impressive performance on visual object classification tasks. In addition, it is a useful model for predication of neuronal responses recorded in visual system. However, there is still no clear understanding of what CNNs learn in terms of visual neuronal circu…

2017-11-08abs ↗pdf ↗

In this paper we present a novel model of the primary visual cortex (V1) based on orientation, frequency and phase selective behavior of the V1 simple cells. We start from the first level mechanisms of visual perception: receptive profiles. The model interprets V1 as a fiber bundle over the 2-dimensional retinal plane …

2019-10-11abs ↗pdf ↗

Researchers classify and visualize 5-cube cubical surfaces.

problem Classifying and visualizing surfaces in a 5-dimensional cube.
method Exhaustive search, classification by genus and demigenus, 3D visualization, reinforcement learning for optimization.
result 2690 connected closed cubical surfaces in the 5-cube, visualized and optimized for 3D printing.

We propose a link prediction algorithm that is based on spring-electrical models. The idea to study these models came from the fact that spring-electrical models have been successfully used for networks visualization. A good network visualization usually implies that nodes similar in terms of network topology, e.g., co…

2019-05-24abs ↗pdf ↗

We provide a rigorous definition of the visual cause of a behavior that is broadly applicable to the visually driven behavior in humans, animals, neurons, robots and other perceiving systems. Our framework generalizes standard accounts of causal learning to settings in which the causal variables need to be constructed …

2014-12-07abs ↗pdf ↗

Neural network training relies on our ability to find "good" minimizers of highly non-convex loss functions. It is well-known that certain network architecture designs (e.g., skip connections) produce loss functions that train easier, and well-chosen training parameters (batch size, learning rate, optimizer) produce mi…

2017-12-28abs ↗pdf ↗

Theoretical analysis of t-SNE for visualizing clustered data.

problem Understanding t-SNE for visualizing high-dimensional clustered data.
method Gradient descent approach and power iterations based on graph Laplacian.
result Asymptotic equivalence and limiting behavior of t-SNE's early exaggeration stage.

Topological surgery in dimension 33 is intrinsically connected with the classification of 33-manifolds and with patterns of natural phenomena. In this expository paper, we present two different approaches for understanding and visualizing the process of 33-dimensional surgery. In the first approach, we view the proc…

2018-11-20abs ↗pdf ↗

We study the problem of large scale, multi-label visual recognition with a large number of possible classes. We propose a method for augmenting a trained neural network classifier with auxiliary capacity in a manner designed to significantly improve upon an already well-performing model, while minimally impacting its c…

2014-12-20abs ↗pdf ↗

We investigate ways in which to improve the interpretability of LDA topic models by better analyzing and visualizing their outputs. We focus on examining what we refer to as topic similarity networks: graphs in which nodes represent latent topics in text collections and links represent similarity among topics. We descr…

2014-09-26abs ↗pdf ↗

Modeling curvature-sensitive cells in visual cortex with geometric structures.

problem Understanding the functional architecture of curvature-sensitive cells in the visual cortex.
method Geometric model based on Engel structure and SIM(2) symmetry.
result Identified SIM(2) as the natural symmetry group for curvature-sensitive cells.

A Thurston map is a branched covering map from §2§^2 to §2§^2 with a finite postcritical set. We associate a natural Gromov hyperbolic graph $\G=\G(f,\mathcal C)$ with an expanding Thurston map ff and a Jordan curve C\mathcal C on §2§^2 containing $\post(f)$. The boundary at infinity of $\G$ with associated visual me…

2011-09-14abs ↗pdf ↗

Vision Transformers show different internal representations compared to CNNs.

problem Understanding how Vision Transformers solve image classification tasks.
method Comparative analysis of ViT and CNN architectures on image classification benchmarks.
result ViT has more uniform representations across all layers, while CNNs have more varied representations.

In this paper, we are concerned with the problem of creating flattening maps of simply-connected open surfaces in R3\mathbb{R}^3. Using a natural principle of density diffusion in physics, we propose an effective algorithm for computing density-equalizing flattening maps with any prescribed density distribution. By var…

2017-04-08abs ↗pdf ↗

In this paper, a frequency coefficient based on the Sen-Shorrocks-Thon (SST) poverty index notion is proposed. The clustering SST index can be used as the method for determination of the connection between similar neighbor sub-clusters. Consequently, connections can reveal existence of natural homogeneous. Through esti…

2017-10-19abs ↗pdf ↗

We introduce the isoperimetric loss as a regularization criterion for learning the map from a visual representation to a semantic embedding, to be used to transfer knowledge to unknown classes in a zero-shot learning setting. We use a pre-trained deep neural network model as a visual representation of image data, a Wor…

2019-03-15abs ↗pdf ↗

Twin-to-twin transfusion syndrome treatment requires fetoscopic laser photocoagulation of placental vascular anastomoses to regulate blood flow to both fetuses. Limited field-of-view (FoV) and low visual quality during fetoscopy make it challenging to identify all vascular connections. Mosaicking can align multiple ove…

2019-07-15abs ↗pdf ↗

This paper develops a cohomological hierarchy for bistable visual paradoxes.

problem Understanding the hierarchy of visual paradoxes built from bistable elements.
method Develops a cohomological hierarchy using Z2\mathbb{Z}_2 coefficients and a discrete Stokes theorem.
result Reveals a hierarchy of paradox classes from H0H^0 through H2H^2, refined at each degree by the relative/absolute distinction.

Enhances supervised visualization for unseen data using autoencoders and random forest.

problem Lack of generalization to unseen test sets in supervised dimensionality reduction.
method Combines autoencoder and random forest proximities for out-of-sample extension.
result 40% reduction in training time with 10% of training data, achieving consistent quality.

Classifies Morse flows on 3-sphere with specific saddle connections.

problem Classifying Morse-Smale flows on a 3-sphere with specific saddle connections.
method Used generalized Heegaard diagrams (Pr-diagrams) to classify flows.
result Found all possible, up to homeomorphism, ways to embed two circles in a 2-sphere with no more than 10 points of transversal intersection.

Capsule networks improve on traditional neural networks by using vector activations.

problem Comparing capsule networks to traditional neural networks to validate their benefits.
method Deep visualization analysis, feature encoding across vector components, and instantiation parameter encoding.
result Capsule features encode information differently and provide benefits in computer vision applications.

Proposes a spectral method to assess and combine multiple data visualizations.

problem Evaluating and combining the strengths of different data visualization algorithms.
method Spectral method for assessing and combining multiple visualizations.
result Proposes a visualization eigenscore to quantify relative performance and a consensus visualization.

C Croke and B Kleiner have constructed an example of a CAT(0) group with more than one visual boundary. J Wilson has proven that this same group has uncountably many distinct boundaries. In this article we prove that the knot group of any connected sum of two non-trivial torus knots also has uncountably many distinct C…

2007-06-11abs ↗pdf ↗

The paper studies the connectedness of a graph's boundary for surfaces.

problem Understanding the topology of the Gromov boundary of fine curve graphs for surfaces.
method Proved a bounded geodesic image theorem, used to show linear connectivity of the Gromov boundary.
result The Gromov boundary of fine curve graphs for surfaces is linearly connected.