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

244488732976 · Jun 202019922001200920172026
48 results for shaped networks

Paper tackles shape graph registration using neural networks.

problem Constrained registration of shape graphs with varying nodes and edges.
method Shape-Graph Matching Network (SGM-net) with an elastic shape metric loss function.
result State-of-the-art matching performance and reduced computational cost.

Paper analyzes shapes of brain arterial networks using statistical methods.

problem Quantifying and comparing shapes of brain arterial networks.
method Mathematical representation of BAN shapes as elastic shape graphs, development of Riemannian metrics and geometrical tools.
result Age has a clear, quantifiable effect on BAN shapes, with increased variance in shapes as age increases.

A recent Cell paper [Chang and Tsao, 2017] reports an interesting discovery. For the face stimuli generated by a pre-trained active appearance model (AAM), the responses of neurons in the areas of the primate brain that are responsible for face recognition exhibit strong linear relationship with the shape variables and…

2018-05-14abs ↗pdf ↗

New findings connect shaped and unshaped neural networks using differential equations.

problem Understanding the behavior of neural networks with different activation scaling methods.
method Deriving differential equation-based asymptotic characterizations for shaped and unshaped neural networks.
result Two types of unshaped networks converge to the same infinite-depth-and-width limit at initialization.

A neural network learns efficient parametrizations of product shape spaces.

problem Efficiently parametrize complex shape spaces with high computational costs.
method Developed a neural network architecture that separately learns approximations for low-dimensional factors and combines them.
result Demonstrated the effectiveness of the approach on synthetic and real data.

Neural networks predict shapes of first passage percolation sets.

problem Predicting the shape of first passage percolation sets.
method Used a neural network to predict the shape of the set of discovered sites from the distribution of passage times.
result Neural networks can quickly predict the shape of the set of discovered sites from the distribution of passage times.

Study on neural network initialization with shaped infinite depth-and-width networks.

problem Understanding the distribution of random covariance matrices in shaped infinite-depth-and-width networks.
method Introduced the Neural Covariance SDE to model the distribution of the random covariance matrix.
result Identified the precise scaling of the activation function necessary for a non-trivial limit.

PointGMM learns hGMMs from point clouds for 3D shape representation.

problem Lack of shape priors and non-local information in point cloud representations.
method Neural network that learns hierarchical Gaussian mixture models (hGMMs) for 3D shapes.
result Generative model learns meaningful latent space for interpolations and novel shape synthesis.

The paper presents a method for analyzing shape graphs using specific features.

problem Analyzing geometric and topological variations in shape graphs.
method Curated set of topological, geometric, and directional features for shape graph analysis.
result The feature representation is effective for tasks like group comparison and classification.

This work characterizes how data augmentation shapes neural representations.

problem Understanding the impact of data augmentation on neural network representations.
method Embedding neural network hidden representations into a metric space invariant to transformations, analyzing shape-space trajectories.
result Increasing data augmentation strength leads to well-behaved trajectories in the embedded space, and different augmentation types steer representations in distinct directions.

The success of various applications including robotics, digital content creation, and visualization demand a structured and abstract representation of the 3D world from limited sensor data. Inspired by the nature of human perception of 3D shapes as a collection of simple parts, we explore such an abstract shape represe…

2017-08-04abs ↗pdf ↗

SVarM uses varifold representations for shape classification and regression.

problem Challenges in analyzing geometric data due to non-Euclidean shape spaces.
method Develops a neural network-based framework for varifold representations of shapes.
result Demonstrates strong performance and robustness in shape classification and regression.

The importance of training robust neural network grows as 3D data is increasingly utilized in deep learning for vision tasks in robotics, drone control, and autonomous driving. One commonly used 3D data type is 3D point clouds, which describe shape information. We examine the problem of creating robust models from the …

2019-08-16abs ↗pdf ↗

We consider convex symmetric lens-shaped networks in R^2 that evolve under curve shortening flow. We show that the enclosed convex domain shrinks to a point in finite time. Furthermore, after appropriate rescaling the evolving networks converge to a self-similarly shrinking network, which we prove to be unique in an ap…

2007-11-07abs ↗pdf ↗

Analog BNNs perform similarly regardless of noise distribution shape.

problem Difficulty in precisely controlling noise distribution shape in analog devices.
method Used real device noise as the variational distribution in MFVI training.
result Predictive distributions converge to the same distribution regardless of noise shape.

Study S-shaped utility maximization with VaR constraint and unobservable drift.

problem Maximizing utility with a Value at Risk (VaR) constraint and unknown drift.
method Bayesian filter, concavification principle, change of measure, semi-closed integral representation, algorithms (Lagrange, simulation, deep neural network).
result Critical wealth level determining solution feasibility and optimal solution existence.

Left atrium shape has been shown to be an independent predictor of recurrence after atrial fibrillation (AF) ablation. Shape-based representation is imperative to such an estimation process, where correspondence-based representation offers the most flexibility and ease-of-computation for population-level shape statisti…

2018-09-30abs ↗pdf ↗

New method learns shape correspondences robustly from raw geometry.

problem Inaccurate and poor generalization of shape correspondences.
method Learning-based approach with feature-extraction network and functional map representation.
result Robust and accurate shape correspondence learning with less training data.

Detection of cell nuclei in microscopic images is a challenging research topic, because of limitations in cellular image quality and diversity of nuclear morphology, i.e. varying nuclei shapes, sizes, and overlaps between multiple cell nuclei. This has been a topic of enduring interest with promising recent success sho…

2018-06-29abs ↗pdf ↗

New method uses cluster shapes to improve track finding in particle collisions.

problem Combining timing and additional detector information for efficient track finding.
method Neural networks to analyze cluster shapes for track seeding.
result Cluster shapes reduce fake combinatorial backgrounds while maintaining high track efficiency.

We solve S-shaped utility portfolio selection with SD constraints using algorithms and neural networks.

problem Optimizing portfolios with S-shaped utility functions under SD constraints.
method First-order SD constraint solution, numerical algorithm for SSD, neural network approach.
result Effective numerical and neural network solutions for SSD constrained problems.

The paper explores a new method for landmark matching using sub-Riemannian geometry and neural networks.

problem Finding a time-dependent vector field to warp points from an initial set to a target set.
method Sub-Riemannian geometry and residual neural networks.
result Demonstrates the importance of regularization in landmark matching.

We introduce a guide to help deep learning practitioners understand and manipulate convolutional neural network architectures. The guide clarifies the relationship between various properties (input shape, kernel shape, zero padding, strides and output shape) of convolutional, pooling and transposed convolutional layers…

2016-03-23abs ↗pdf ↗

New neural network models extreme value distributions with preserved shape constraints.

problem Modeling multivariate extreme value distributions with preserved shape constraints.
method d-max-decreasing neural network architecture for non-parametric calibration and generation of MEVs.
result The proposed architecture approximates the dependence structure of MEVs at parametric rate and preserves essential shape constraints.

Topology-enhanced loss improves 3D object reconstruction from 2D images.

problem Challenges in reconstructing 3D objects from 2D images, especially capturing shape information.
method Integrates multi-scale topological features into the reconstruction loss using cubical complexes and optimal transport distance.
result Topology-aware loss substantially improves 3D reconstruction quality.

New scheme optimizes BMI through probabilistic and geometric shaping.

problem Optimizing bit-wise mutual information (BMI) for coded modulation.
method Joint optimization of BMI through probabilistic and geometric shaping.
result Joint optimization enables a continuum of constellation geometries and probability distributions.

Training shapes the geometry of neural network feature maps, revealing local area magnification.

problem Understanding how training affects the geometric structure of neural network feature maps.
method Analyzing the Riemannian geometry induced by neural network feature maps at infinite width and after training.
result Training breaks the symmetry of the geometry induced by random neural network feature maps, magnifying local areas along decision boundaries.

ES-VAE models skeletal pose trajectories by removing nuisance factors.

problem Handling camera orientation, subject scale, viewpoint, and execution speed in skeletal data.
method ES-VAE uses TSRVF representation on Kendall's shape manifold to isolate shape dynamics.
result ES-VAE outperforms standard VAEs and sequence modeling baselines in gait cycle prediction and action recognition.

The paper proposes a deep learning approach to efficiently approximate diffeomorphisms for shape alignment.

problem Finding optimal reparameterizations of shapes for computing geodesic distances.
method The authors develop a neural network-based algorithm to construct approximations of diffeomorphisms using PyTorch.
result The proposed method achieves universal approximation properties and bounds on Lipschitz constants for the constructed diffeomorphisms.

Representing shapes as level sets of neural networks has been recently proved to be useful for different shape analysis and reconstruction tasks. So far, such representations were computed using either: (i) pre-computed implicit shape representations; or (ii) loss functions explicitly defined over the neural level sets…

2020-02-24abs ↗pdf ↗

T-Basis represents neural network tensors with fewer parameters.

problem Efficiently representing neural network tensors with fewer parameters.
method T-Basis uses Tensor Rings to represent tensors in a neural network, parameterizing them with a small number of coefficients.
result T-Basis achieves high compression rates with minimal performance loss.

The paper reveals surprising star-shaped connectivity in neural networks.

problem Understanding mode connectivity in neural network landscapes.
method Fine-grained analysis of connectivity in overparameterized and finite minima cases.
result Star-shaped connectivity exists in neural network landscapes, suggesting near convexity.

Our work sheds new light on the role of oil prices in shaping the world economy by investigating flows of goods and services through global value chains between 1960 and 2011, by means of Markov Chain and network analysis. We show that over that time period the international division of labor and trade patterns are tig…

2015-02-28abs ↗pdf ↗

We study the curvature flow of planar nonconvex lens-shaped domains, considered as special symmetric networks with two triple junctions. We show that the evolving domain becomes convex in finite time; then it shrinks homothetically to a point. Our theorem is the analog of the result of Grayson for curvature flow of clo…

2009-05-31abs ↗pdf ↗

Polygonal meshes provide an efficient representation for 3D shapes. They explicitly capture both shape surface and topology, and leverage non-uniformity to represent large flat regions as well as sharp, intricate features. This non-uniformity and irregularity, however, inhibits mesh analysis efforts using neural networ…

2018-09-16abs ↗pdf ↗