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,695 papers · 148 categories

Trend · papers per month

16314762 · May 202619922001200920172026
48 results for painting entropy

This paper measures the information quantity in paintings using entropy.

problem Traditional art pricing models lack variables capturing painting content.
method Extends Shannon entropy to measure painting information using pixel-level variances of line, color, value, shape/form, and space.
result Variance measurements significantly explain sales prices, improving traditional models.

This paper makes the first attempt to introduce the tools from computer graphics into the art pricing research. We argue that the creation of a painting calls for a combination of conceptual effort and painting effort from the artist. However, as the important price determinants, both efforts are long missing in the tr…

2019-10-09abs ↗pdf ↗

This paper introduces a novel approach to in-painting where the identity of the object to remove or change is preserved and accounted for at inference time: Exemplar GANs (ExGANs). ExGANs are a type of conditional GAN that utilize exemplar information to produce high-quality, personalized in painting results. We propos…

2017-12-11abs ↗pdf ↗

Generates garden paintings from text descriptions using deep learning.

problem Lack of firsthand material for traditional Chinese garden reconstruction.
method Deep learning model trained on text and paintings of Ming Dynasty gardens.
result Model generates garden paintings in Ming Dynasty style based on textual descriptions.

We examined the use of modern Generative Adversarial Nets to generate novel images of oil paintings using the Painter By Numbers dataset. We implemented Spectral Normalization GAN (SN-GAN) and Spectral Normalization GAN with Gradient Penalty, and compared their outputs to a Deep Convolutional GAN. Visually, and quantit…

2019-03-06abs ↗pdf ↗

Kähler complexity one Hamiltonian T-manifolds have trivial paintings.

problem Understanding the structure of Kähler complexity one Hamiltonian T-manifolds.
method Proving the existence of a trivial painting for compact, connected Kähler complexity one Hamiltonian T-manifolds.
result Every compact, connected Kähler complexity one Hamiltonian T-manifold has a trivial painting.

In this paper, computer-based techniques for stylistic analysis of paintings are applied to the five panels of the 14th century Peruzzi Altarpiece by Giotto di Bondone. Features are extracted by combining a dual-tree complex wavelet transform with a hidden Markov tree (HMT) model. Hierarchical clustering is used to ide…

2014-01-26abs ↗pdf ↗

We investigate using reinforcement learning agents as generative models of images (extending arXiv:1804.01118). A generative agent controls a simulated painting environment, and is trained with rewards provided by a discriminator network simultaneously trained to assess the realism of the agent's samples, either uncond…

2019-10-02abs ↗pdf ↗

Camera and lidar are important sensor modalities for robotics in general and self-driving cars in particular. The sensors provide complementary information offering an opportunity for tight sensor-fusion. Surprisingly, lidar-only methods outperform fusion methods on the main benchmark datasets, suggesting a gap in the …

2019-11-22abs ↗pdf ↗

Notwithstanding almost forty years of efforts, the market for paintings still lacks a widely accepted price index. In this paper, we introduce a simple and intuitive metric to construct such index. Our metric is based on the price of a painting divided by its area. This formulation rests on a solid mathematical foundat…

2014-04-21abs ↗pdf ↗

Conditional Generative Adversarial Networks~(CGAN) are a recent and popular method for generating samples from a probability distribution conditioned on latent information. The latent information often comes in the form of a discrete label from a small set. We propose a novel method for training CGANs which allows us t…

2019-06-21abs ↗pdf ↗

Unified mathematical framework for non-compact symmetric spaces with negative curvature.

problem Understanding and organizing non-compact symmetric spaces with negative curvature.
method Unified mathematical framework, including explicit distance functions and universality classes.
result Unified classification of non-compact symmetric spaces with non-compact rank r<5.

New method for conditional sampling using M-GANs, likely-free inference.

problem Conditional sampling of probability measures.
method Developed a novel computational approach called M-GANs based on block triangular transport.
result Accurate sampling of conditional measures in various applications.

We consider triangulations of surfaces with edges painted three colors so that edges of each triangle have different colors. Such structures arise as Belyi data (or Grothendieck dessins d'enfant), on the other hand they enumerate pairs of permutations determined up to a common conjugation. The topic of these notes is l…

2017-10-31abs ↗pdf ↗

In this paper we address the problem of artist style transfer where the painting style of a given artist is applied on a real world photograph. We train our neural networks in adversarial setting via recently introduced quadratic potential divergence for stable learning process. To further improve the quality of genera…

2019-02-14abs ↗pdf ↗

Sparse coding has shown its power as an effective data representation method. However, up to now, all the sparse coding approaches are limited within the single domain learning problem. In this paper, we extend the sparse coding to cross domain learning problem, which tries to learn from a source domain to a target dom…

2013-11-27abs ↗pdf ↗

In this paper, we introduce an unsupervised learning approach to automatically discover, summarize, and manipulate artistic styles from large collections of paintings. Our method is based on archetypal analysis, which is an unsupervised learning technique akin to sparse coding with a geometric interpretation. When appl…

2018-05-28abs ↗pdf ↗

Study improves posterior inference in neural processes with limited data.

problem Improving posterior predictive inference in probabilistic models with scarce conditioning data.
method Examined effects of pooling operators and variational families on posterior quality in neural processes.
result Novel neural process architectures lead to superior posterior predictive samples in image completion/in-painting tasks.

Enhances RL by controlling policy stochasticity through trajectory entropy constraints.

problem Non-stationary Q-value estimation and short-sighted entropy tuning in maximum entropy RL.
method Proposes TECRL framework with separate Q-functions for reward and entropy, enforcing a trajectory entropy constraint.
result DSAC-E algorithm achieves higher returns and better stability on OpenAI Gym benchmarks.

It is well known that deep generative models have a rich latent space, and that it is possible to smoothly manipulate their outputs by traversing this latent space. Recently, architectures have emerged that allow for more complex manipulations, such as making an image look as though it were from a different class, or p…

2019-11-29abs ↗pdf ↗

The paper calculates bounds for risk metrics and entropies under partial information constraints.

problem Analyzing risk metrics and entropies for unimodal, symmetric distributions with limited information.
method Develops lower and upper bounds for worst-case distortion riskmetrics and weighted entropy for unimodal, symmetric distributions with known mean and variance.
result Sharp upper bounds for distortion riskmetrics and weighted entropy for symmetric distributions.

The paper analyzes worst-case distortion risk metrics and weighted entropy under partial information.

problem Analyzing worst-case distortion risk metrics and weighted entropy with limited information.
method General distributions, partial information (mean and variance), various entropies and risk measures.
result Provides worst-case results for distortion risk metrics and weighted entropy.

HCLM framework uses entropy regularization for open learning systems.

problem Real-world AI challenges and limitations of deep learning.
method Dynamical and information-theoretic framework with entropy regularization.
result Geometric entropy surrogates, especially log-determinant covariance entropy, induce stronger and more stable information forces.

JES optimizes expensive functions by considering joint entropy over input and output spaces.

problem Optimizing expensive functions with limited evaluations.
method Joint Entropy Search (JES) considers joint entropy over input and output spaces.
result JES outperforms other information-theoretic methods in Bayesian optimization.

We give a notion of entropy for general gemetric structures, which generalizes well-known notions of topological entropy of vector fields and geometric entropy of foliations, and which can also be applied to singular objects, e.g. singular foliations, singular distributions, and Poisson structures. We show some basic p…

2011-09-24abs ↗pdf ↗