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

2545087611,015 · Jun 202019922001200920172026
48 results for Holographic Global Convolutional Networks

HGConv uses HRR to efficiently detect malware, outperforming existing methods.

problem Efficiently detecting malware with long sequences.
method Holographic Global Convolutional Networks (HGConv) utilizing Holographic Reduced Representations (HRR).
result Achieved state-of-the-art results on malware benchmarks.

Secure neural network inference on untrusted platforms using holographic reduced representations.

problem Secure neural network inference on untrusted platforms.
method Connectionist Symbolic Pseudo Secrets using Holographic Reduced Representations (HRR).
result Empirical robustness to attack under various threat models.

New framework constructs holographic tensor networks using hyperbolic buildings.

problem Building holographic tensor networks for non-integer dimensions and fractal spaces.
method Introducing a unifying framework based on hyperbolic buildings and dualities.
result Constructs a family of bulk regions satisfying complementary recovery and Ryu-Takayanagi formula.

Bit threads provide an alternative description of holographic entanglement, replacing the Ryu-Takayanagi minimal surface with bulk curves connecting pairs of boundary points. We use bit threads to prove the monogamy of mutual information (MMI) property of holographic entanglement entropies. This is accomplished using t…

2018-08-15abs ↗pdf ↗

Convolutional neural networks converge quickly with gradient descent.

problem Learning efficient image classifiers with over-parameterized networks.
method Gradient descent for training over-parametrized CNNs with global average-pooling.
result Gradient descent quickly reduces the misclassification risk of CNNs.

Representation learning is at the heart of what makes deep learning effective. In this work, we introduce a new framework for representation learning that we call "Holographic Neural Architectures" (HNAs). In the same way that an observer can experience the 3D structure of a holographed object by looking at its hologra…

2018-06-04abs ↗pdf ↗

We discuss several aspects of the relation between asymptotically AdS and asymptotically dS spacetimes including: the continuation between these types of spaces, the global stability of asymptotically dS spaces and the structure of limits within this class, holographic renormalization, and the maximal mass conjecture o…

2004-07-12abs ↗pdf ↗

L-CNNs maintain gauge symmetry on non-Abelian lattice theories.

problem Applying convolutional neural networks to non-Abelian lattice gauge theories while preserving gauge symmetry.
method Developed a geometric formulation of L-CNNs that are equivariant under global symmetries and gauge transformations.
result Convolutional operations in L-CNNs are a specific case of gauge-equivariant neural networks on SU(NN) principal bundles.

Study improves pollen detection in optical and holographic images using deep learning.

problem Improving pollen detection accuracy in holographic microscopy images.
method Used YOLOv8s for detection and MobileNetV3L for classification, addressing performance gaps through dataset expansion and automated labeling.
result Significant improvement in detection and classification performance on holographic images.

New formula connects holographic entanglement entropy to Willmore energy in 5D.

problem Analogous to 3D, find a new formula for 5D entanglement entropy.
method Prove equivalence between holographic entanglement entropy and Willmore energy in 5D.
result The Willmore energy in 5D is not globally minimized by a round ball.

We derive and study supergravity BPS flow equations for M5 or D3 branes wrapping a Riemann surface. They take the form of novel geometric flows intrinsically defined on the surface. Their dual field-theoretic interpretation suggests the existence of solutions interpolating between an arbitrary metric in the UV and the …

2011-09-16abs ↗pdf ↗

This paper derives an explicit formula for Branson's Q-curvature in even-dimensional conformal geometry. The ingredients in the formula come from the Poincare metric in one higher dimension; hence the formula is called holographic. When specialized to the conformally flat case, the holographic formula expresses Q-curva…

2007-04-13abs ↗pdf ↗

In the presence of boundaries the integrated conformal anomaly is modified by the boundary terms so that the anomaly is non-vanishing in any (even or odd) dimension. The boundary terms are due to extrinsic curvature whose exact structure in d=3d=3 and d=4d=4 has recently been identified. In this note we present a hologra…

2017-02-02abs ↗pdf ↗

Lie groupoid equivariant neural networks are a new type of neural network.

problem Designing neural networks that respect the structure of Lie groupoids.
method Introducing Lie groupoid equivariant convolutions and layers, and showing their equivalence to Lie algebroid-equivariant networks.
result Lie groupoid equivariant neural networks are equivalent to certain Lie algebroid-equivariant networks.

Any traversally generic vector flow on a compact manifold XX with boundary leaves some residual structure on its boundary $\d X$. A part of this structure is the flow-generated causality map CvC_v, which takes a region of $\d X$ to the complementary region. By the Holography Theorem from \cite{K4}, the map CvC_v allow…

2018-06-27abs ↗pdf ↗

The Ryu-Takayanagi (RT) formula relates the entanglement entropy of a region in a holographic theory to the area of a corresponding bulk minimal surface. Using the max flow-min cut principle, a theorem from network theory, we rewrite the RT formula in a way that does not make reference to the minimal surface. Instead, …

2016-04-01abs ↗pdf ↗

Learning embeddings of entities and relations is an efficient and versatile method to perform machine learning on relational data such as knowledge graphs. In this work, we propose holographic embeddings (HolE) to learn compositional vector space representations of entire knowledge graphs. The proposed method is relate…

2015-10-16abs ↗pdf ↗

Study on bit threads and their locking properties in holographic spacetimes.

problem Understanding the conditions under which regions can be locked in holographic spacetimes.
method Investigation of different density bounds and their implications on the locking of regions.
result Non-crossing regions can be locked under the most stringent bound, but crossing regions cannot.

Researchers create holographic super-embeddings for M5 and M2 branes.

problem No concrete examples of super-embeddings for M5 and M2 branes existed.
method Constructed explicit holographic super-embeddings of probe M5 and M2 branes into their super-AdS backgrounds.
result Explicit holographic super-embeddings of M5 and M2 branes were successfully constructed.

Max-pooling architectures are theoretically analyzed and shown to be globally optimized and generalize well.

problem Theoretical understanding and optimization of max-pooling in deep learning architectures.
method Theoretical analysis of a convolutional max-pooling architecture, focusing on a pattern detection problem.
result Max-pooling architectures can be globally optimized and generalize well, even for highly over-parameterized models.

Tensor regression networks achieve high compression rate of neural networks while having slight impact on performances. They do so by imposing low tensor rank structure on the weight matrices of fully connected layers. In recent years, tensor regression networks have been investigated from the perspective of their comp…

2017-12-27abs ↗pdf ↗

CTGCN learns dynamic graph embeddings preserving both local and global graph structure.

problem Learning node representations for evolving graphs while preserving both local and global graph structure.
method CTGCN uses k-core based temporal graph convolutional network to learn dynamic graph embeddings.
result CTGCN outperforms existing methods in link prediction and structural role classification.

High-dimensional ConvNets detect patterns in 32+ dimensions for geometric registration.

problem Detecting geometric patterns in high-dimensional spaces.
method High-dimensional convolutional networks applied to geometric registration problems.
result High-dimensional ConvNets outperform global pooling approaches in 3D registration and image correspondence.

ARMA nets expand receptive fields for dense prediction tasks.

problem Global information in dense prediction problems is challenging for traditional convolutional layers.
method ARMA layers with adjustable autoregressive coefficients replace traditional convolutions.
result ARMA networks improve dense prediction tasks including video prediction and semantic segmentation.

The principle of equivariance to symmetry transformations enables a theoretically grounded approach to neural network architecture design. Equivariant networks have shown excellent performance and data efficiency on vision and medical imaging problems that exhibit symmetries. Here we show how this principle can be exte…

2019-02-11abs ↗pdf ↗

Holographic Invariant Storage uses vector architectures to ensure LLM safety at design time.

problem Mitigating context drift in large language models (LLMs) during deployment.
method Introduces Holographic Invariant Storage (HIS) protocol that combines known properties of bipolar Vector Symbolic Architectures into a design-time safety contract.
result Closed-form guarantees for single-signal recovery fidelity, continuous-noise robustness, and multi-signal capacity degradation are provided and validated.

AI enhances pollen recognition in veterinary imaging using holographic microscopy.

problem Challenges in recognizing pollen in holographic images due to speckle noise and artifacts.
method Training YOLOv8s and MobileNetV3L on dual-modality dataset, employing WGAN-SN for synthetic data augmentation.
result GAN-based augmentation improves object detection and classification in holographic images, closing the performance gap.

Gradient descent finds a global minimum in training deep neural networks despite the objective function being non-convex. The current paper proves gradient descent achieves zero training loss in polynomial time for a deep over-parameterized neural network with residual connections (ResNet). Our analysis relies on the p…

2018-11-09abs ↗pdf ↗

Semi-supervised learning on graph structured data has received significant attention with the recent introduction of Graph Convolution Networks (GCN). While traditional methods have focused on optimizing a loss augmented with Laplacian regularization framework, GCNs perform an implicit Laplacian type regularization to …

2018-05-29abs ↗pdf ↗

This paper improves land cover classification using global spatial features in CNN.

problem Limited classification accuracy and universality of traditional remote sensing image classification methods.
method Integrates global spatial features into a dual-branch CNN for hyperspectral/SAR imagery classification.
result The proposed method outperforms traditional single-channel CNN methods.

A3T-GCN improves traffic forecasting by capturing spatial and temporal dependencies.

problem Accurate real-time traffic forecasting in complex road networks.
method Attention Temporal Graph Convolutional Network (A3T-GCN) integrating recurrent units and graph convolutional network.
result Improved prediction accuracy through attention mechanism and global temporal information.

Popular graph neural networks implement convolution operations on graphs based on polynomial spectral filters. In this paper, we propose a novel graph convolutional layer inspired by the auto-regressive moving average (ARMA) filter that, compared to polynomial ones, provides a more flexible frequency response, is more …

2019-01-05abs ↗pdf ↗