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.

169,181 papers · 148 categories

Trend · papers per month

69138206275 · Jun 202019922001200920182026
48 results for Image Analogy

Generates convincing swapped images of fashion articles on people.

problem Automatic swapping of clothing on fashion model photos.
method Conditional Analogy Generative Adversarial Network (CAGAN) based on adversarial training and deep convolutional neural networks.
result Plausible segmentation masks and convincing swapped images.

Recent progress in applying machine learning for jet physics has been built upon an analogy between calorimeters and images. In this work, we present a novel class of recursive neural networks built instead upon an analogy between QCD and natural languages. In the analogy, four-momenta are like words and the clustering…

2017-02-02abs ↗pdf ↗

Framework translates unlabeled images between domains.

problem Translating unlabeled images between domains with no supervision.
method Skip-connected encoder-generator structure trained with GAN, cycle, and semantic consistency losses.
result Framework can learn semantic mappings for face images without supervised one-to-one mapping.

Study slopes of direct images in complex manifolds, proving a Mehta-Ramanathan type theorem.

problem Distribution of Harder-Narasimhan slopes in direct image sheaves.
method Analyzing asymptotic distributions of slopes under base changes of families of complex projective manifolds.
result Asymptotic distribution of slopes can be recovered from base changes over generic curves.

An unsupervised learning algorithm trains capsule networks for generating realistic images.

problem Training capsule networks for generating realistic images without labeled data.
method Developed an unsupervised learning algorithm using dynamic routing and an energy function for capsule networks.
result The algorithm successfully generates realistic looking images from a learned distribution.

Few-shot unsupervised image-to-image translation model learns from a few examples.

problem Current unsupervised image-to-image translation methods require many images at training time.
method Coupling adversarial training with a novel network design for few-shot learning.
result Model achieves effective few-shot image-to-image translation.

There is a concept in digital topology of a shy map. We define an analogous concept for topological spaces: We say a function is shy if it is continuous and the inverse image of every path-connected subset of its image is path-connected. Some basic properties of such maps are presented. For example, every shy map onto …

2017-05-25abs ↗pdf ↗

Polarimetric Synthetic Aperture Radar (PolSAR) images are establishing as an important source of information in remote sensing applications. The most complete format this type of imaging produces consists of complex-valued Hermitian matrices in every image coordinate and, as such, their visualization is challenging. Th…

2012-07-03abs ↗pdf ↗

This paper studies a deformation retraction of Teichmüller space and its analogy with well-rounded retractions.

problem Understanding the well-rounded deformation retraction of Teichmüller space.
method Examining the mapping class group-equivariant deformation retraction of Teichmüller space onto a CW complex and comparing it to well-rounded retractions of other spaces.
result The well-rounded deformation retraction of Teichmüller space is analogous to well-rounded retractions of other spaces.

Anosov representations of word hyperbolic groups into higher-rank semisimple Lie groups are representations with finite kernel and discrete image that have strong analogies with convex cocompact representations into rank-one Lie groups. However, the most naive analogy fails: generically, Anosov representations do not a…

2017-01-31abs ↗pdf ↗

Adds a precortical module to CNNs for improved robustness to light variations.

problem Robustness of CNNs to global light intensity and contrast variations.
method Developed a mathematical model of the mammalian visual pathway, inspired by CNNs, and added a preliminary convolutional module.
result Significantly more robust CNNs achieved with added module on MNIST, FashionMNIST, and SVHN databases.

We develop an analogy between right-angled Artin groups and mapping class groups through the geometry of their actions on the extension graph and the curve graph respectively. The central result in this paper is the fact that each right-angled Artin group acts acylindrically on its extension graph. From this result we …

2013-05-19abs ↗pdf ↗

The purpose of this paper is to define semi- and subanalytic subsets and maps in the context of real analytic orbifolds and to study their basic properties. We prove results analogous to some well-known results in the manifold case. For example, we prove that if AA is a subanalytic subset of a real analytic quotient o…

2011-04-24abs ↗pdf ↗

Let MM be a closed connected smooth manifold and G=Diff0(M)G=\textmd{Diff}_0(M) denote the connected component of the diffeomorphism group of MM containing the identity. The natural action of GG on MM induces the trace homomorphism on homology. We show that the image of trace homomorphism is annihilated by the subalgebra o…

2005-03-21abs ↗pdf ↗

ProtoPNet uses deep learning to classify images by identifying prototypical parts.

problem Challenging image classification tasks where understanding reasoning is important.
method ProtoPNet architecture that reasons by finding prototypical parts and combining evidence.
result ProtoPNet achieves comparable accuracy to non-interpretable models and provides interpretability.

In this paper we construct a complete injective holomorphic immersion CC2\mathbb{C}\to\mathbb{C}^2 whose image is dense in C2\mathbb{C}^2. The analogous result is obtained for any closed complex submanifold XCnX\subset \mathbb{C}^n for n>1n>1 in place of CC2\mathbb{C}\subset\mathbb{C}^2. We also show that, if XX intersect…

2017-02-26abs ↗pdf ↗

A graph's winding numbers around two non-adjacent vertices differ by ±1.

problem Understanding the winding numbers of a specific graph configuration in the plane.
method Analyzing continuous maps from a graph to the plane, focusing on the winding numbers of specific cycles.
result The difference in winding numbers of a cycle around two non-adjacent vertices is ±1.

Bayesian tensor network reduces conditional probability calculation to polynomial time.

problem Exponential cost of calculating conditional probabilities for multiple events.
method Bayesian tensor network (BTN) with polynomial complexity.
result Competitive performance in image recognition with simple tree structures.

New algorithm defends against adversarial examples in image classification.

problem Defending against adversarial examples in image classification.
method Approximates Discrete Fourier transform of sparse signals corrupted by L0L_0 noise.
result Successfully defends against L0L_0 adversaries in image classification.

Various semigroups of noninvertible supermatrices of the special (antitriangle) shape having nilpotent Berezinian which appear in supersymmetric theories are defined and investigated. A subset of them continuously represents left and right zero semigroups and rectangular bands. The ideal properties of higher order rect…

1996-09-19abs ↗pdf ↗

Convolutional Neural Networks (CNNs) have proven very effective in image classification and show promise for audio. We use various CNN architectures to classify the soundtracks of a dataset of 70M training videos (5.24 million hours) with 30,871 video-level labels. We examine fully connected Deep Neural Networks (DNNs)…

2016-09-29abs ↗pdf ↗

The introduction of convolutional layers greatly advanced the performance of neural networks on image tasks due to innately capturing a way of encoding and learning translation-invariant operations, matching one of the underlying symmetries of the image domain. In comparison, there are a number of problems in which the…

2016-12-14abs ↗pdf ↗

Adapts Lifelong Learning for Federated Learning to prevent model drift.

problem Federated Learning on non-i.i.d. data leads to model divergence and forgetting.
method Adds a penalty term to the loss function to encourage convergence of local models to a shared optimum.
result The method improves performance in image recognition tasks compared to existing approaches.

The paper evaluates saliency methods for image predictions, finding some inadequate.

problem The reliability of saliency methods in explaining model predictions.
method Proposed a methodology to evaluate saliency methods based on their independence from model and data.
result Some saliency methods are independent of both model and data, making them inadequate for certain tasks.

We extend some results of [BF12] on subfactor projections to show that the projection of a free factor B to the free factor complex of the free factor A is well-defined with uniformly bound diameter, unless either A is contained in B or A and B are vertex stabilizers of a single splitting of F_n, i.e. they are disjoint…

2013-07-04abs ↗pdf ↗

Numerous important problems can be framed as learning from graph data. We propose a framework for learning convolutional neural networks for arbitrary graphs. These graphs may be undirected, directed, and with both discrete and continuous node and edge attributes. Analogous to image-based convolutional networks that op…

2016-05-17abs ↗pdf ↗

Layered graphical models improve discriminative learning efficiency.

problem Improving discriminative learning efficiency in graphical models.
method Designing layered graphical models (LGMs) in analogy to neural networks, using tensorized truncated variational inference and backpropagation.
result LGMs achieve competitive results in image classification, comparable to neural networks.

Shephard groups are unitary reflection groups arising as the symmetries of regular complex polytopes. For a Shephard group, we identify the representation carried by the principal ideal in the coinvariant algebra generated by the image of the product of all linear forms defining reflecting hyperplanes. This representat…

2000-11-15abs ↗pdf ↗

In 1960 Reifenberg proved the topological disc property. He showed that a subset of RnR^n which is well approximated by mm-dimensional affine spaces at each point and at each (small) scale is locally a bi-Hölder image of the unit ball in RmR^m. In this paper we prove that a subset of R3R^3 which is well approximated b…

2006-07-18abs ↗pdf ↗

Analog forecasting uses local dynamics to predict chaotic systems.

problem Theoretical connections between analog forecasting and dynamical systems are overlooked.
method Local approximations of the system's dynamics, linear regression, and estimation of analog forecasting errors.
result Analog forecasting performances are highly linked to the local Jacobian matrix of the flow map.

The abstract investigates convexity in locally conformally symplectic geometry.

problem Characterizing and proving convexity in locally conformally symplectic manifolds.
method Geometric characterization and proof of convexity theorems for twisted and symplectic moment maps.
result Established an analog of the symplectic convexity theorem for locally conformally symplectic manifolds.

ADR helps LLMs find and use historical analogies for foresight analysis.

problem LLMs struggle to find relevant historical analogies due to surface-level matching.
method Proposes CANA framework with mechanism alignment and cross-analogy confirmation.
result CANA improves historical analogy generation by up to 10%.

We prove that a 3--dimensional hyperbolic cusp with convex polyhedral boundary is uniquely determined by its Gauss image. Furthermore, any spherical metric on the torus with cone singularities of negative curvature and all closed contractible geodesics of length greater than 2π is the metric of the Gauss image of som…

2009-08-14abs ↗pdf ↗

Analog methods improve forecast accuracy in complex models.

problem Improving forecast accuracy in complex models like Lorenz-96.
method Constructing analogs using variational autoencoders for ensemble data assimilation.
result Constructed analogs perform as well as a full ensemble square root filter.

The paper evaluates the probability distributions of analog-to-target distances for multiple analogs.

problem Understanding the performance of analog applications through the distribution of distances to target states.
method Theoretical analysis and numerical experiments using dynamical systems theory.
result The size of the catalog and dimensionality affect the probability distributions of the K-best analogs.

Bayesian method for estimating functional graphical models from neuroimaging data.

problem Estimating dependence structures from functional data in neuroscience.
method Fully Bayesian regularization scheme, including direct Bayesian analog of functional graphical lasso and graphical horseshoe.
result Insight into brain compensation after traumatic brain injury.