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

3527031,0551,406 · Jun 202019922001200920172026
48 results for Watson's perceptual model

A new loss function for VAEs improves image quality and efficiency.

problem Training VAEs to generate realistic images requires a loss function that reflects human perception.
method Based on Watson's perceptual model, the loss function computes a weighted distance in frequency space, accounts for luminance and contrast masking, and is extended to color images.
result VAEs trained with the new loss function generated high-quality, less blurry images with fewer artifacts and less computational resources.

This paper models stock prices using a Janardan Galton Watson process.

problem Modeling stock price fluctuations and predicting market trends.
method Extends Janardan Galton Watson process to model stock prices, considering initial close price and number of offspring.
result The model predicts return values and probability of market extinction.

This note provides an error bound for the Hartman-Watson integral's leading term.

problem Bounding the error of the leading term of the Hartman-Watson integral.
method Asymptotic expansion analysis focusing on the regime rt=ρrt=ρ constant.
result The error term is bounded uniformly as ϑ(t,ρ)170t|\vartheta(t,ρ)|\leq \frac{1}{70}t.

New method defends against unseen threat models using perceptual adversarial training.

problem Lack of precise mathematical characterization of human perception in adversarial attacks.
method Adversarial training against the set of all imperceptible adversarial examples approximated by deep neural networks.
result Perceptual Adversarial Training (PAT) achieves state-of-the-art robustness against multiple diverse adversarial attacks.

A new method TNW-CATE estimates treatment effects using neural networks.

problem Estimating heterogeneous treatment effects with limited controls and many treatments.
method Trainable Nadaraya-Watson regression with shared parameters neural network.
result TNW-CATE outperforms traditional methods in various simulation experiments.

Paper provides an upper bound for bias of Nadaraya-Watson kernel regression.

problem Estimating bias of Nadaraya-Watson kernel regression for finite bandwidths.
method Proposes an upper bound for bias under Lipschitz assumptions, extending to discontinuous derivatives and multidimensional domains.
result Upper bound on bias for finite bandwidths, tighter than previous infinitesimal bandwidth analysis.

We show that any exceptional non-trivial Dehn surgery on a twist knot, except the trefoil, yields a 3-manifold whose fundamental group is left-orderable. This is a generalization of a result of Clay, Lidman and Watson, and also gives a new supporting evidence for a conjecture of Boyer, Gordon and Watson.

2011-09-14abs ↗pdf ↗

We study the secondary structure of RNA determined by Watson-Crick pairing without pseudo-knots using Milnor invariants of links. We focus on the first non-trivial invariant, which we call the Heisenberg invariant. The Heisenberg invariant, which is an integer, can be interpreted in terms of the Heisenberg group as wel…

2008-09-18abs ↗pdf ↗

Perceptual Kalman filters maintain human-perceptual quality while processing data.

problem Maintaining human-perceptual quality in signal processing under temporal constraints.
method An optimal causal filtering approach under a perfect perceptual-quality constraint.
result Adding perceptual quality constraints introduces a dilemma that requires sacrificing MSE for temporal consistency.

Authors derive the first two terms of the Hartman-Watson distribution's expansion for small t.

problem The Hartman-Watson distribution's integral density is difficult to evaluate numerically for small t.
method Saddle point methods and numerical estimates of the integrand.
result Obtained the first two terms of the to0t o 0 expansion of the Hartman-Watson distribution.

We prove that the link of a complex normal surface singularity is an L--space if and only if the singularity is rational. This via a recent result of Hanselman, J. Rasmussen, S. D. Rasmussen and Watson (proving the conjecture of Boyer, Gordon and Watson), shows that a singularity link is not rational if and only if its…

2015-10-24abs ↗pdf ↗

Boyer, Gordon, and Watson have conjectured that an irreducible rational homology 3-sphere is an L-space if and only if its fundamental group is not left-orderable. Since large classes of L-spaces can be produced from Dehn surgery on knots in the 3-sphere, it is natural to ask what conditions on the knot group are suffi…

2014-10-07abs ↗pdf ↗

Study shows perceptual boost of visual attention varies with task difficulty and size.

problem Understanding how task-dependent the perceptual boost of visual attention is in natural settings.
method Designed and trained neural networks on various visual tasks, comparing results to baseline.
result Perceptual boost of attention is stronger with more difficult tasks and weaker with larger task sets.

Recent work has shown that additive threat models, which only permit the addition of bounded noise to the pixels of an image, are insufficient for fully capturing the space of imperceivable adversarial examples. For example, small rotations and spatial transformations can fool classifiers, remain imperceivable to human…

2019-02-21abs ↗pdf ↗

Perceptual ad-blocking is a novel approach that detects online advertisements based on their visual content. Compared to traditional filter lists, the use of perceptual signals is believed to be less prone to an arms race with web publishers and ad networks. We demonstrate that this may not be the case. We describe att…

2018-11-08abs ↗pdf ↗

Improved image generation with private data using perceptual features.

problem Difficulty in training generative models with differential privacy.
method Use pre-trained perceptual features to learn private data distribution.
result Generative models can generate high-quality images with low privacy budget (ϵ2\epsilon \approx 2).

A new perceptual adjustment query for metric learning reduces complexity in high-dimensional data.

problem Metric learning in high-dimensional data with limited human feedback.
method Inverted measurement scheme and two-stage estimator for PAQs.
result Sample complexity guarantees for the two-stage estimator of metric learning from PAQs.

Metric functions for phoneme perception capture the similarity structure among phonemes in a given language and therefore play a central role in phonology and psycho-linguistics. Various phenomena depend on phoneme similarity, such as spoken word recognition or serial recall from verbal working memory. This study prese…

2018-09-20abs ↗pdf ↗

New method disentangles perceptual uncertainty and behavioral costs in partially observable systems.

problem Tackles inverse optimal control for non-linear partially observable systems.
method Probabilistic approach using maximum causal entropy formulations and local linearization.
result Disentangles perceptual factors and behavioral costs in sequential decision-making.

In order to efficiently transmit and store speech signals, speech codecs create a minimally redundant representation of the input signal which is then decoded at the receiver with the best possible perceptual quality. In this work we demonstrate that a neural network architecture based on VQ-VAE with a WaveNet decoder …

2019-10-14abs ↗pdf ↗

Generative models use kernel smoothing for conditioning on small example sets.

problem Improving generative models' performance with limited conditioning examples.
method Showed that cross-attention conditioning is equivalent to kernel smoothing, specifically a Nadaraya--Watson kernel smoother.
result The approach predicts and confirms three failure regimes for kernel-based conditioning.

Paper introduces adversarial lossy compression for video artifacts reduction.

problem Unpleasant reconstruction artifacts in standard video coding schemes at low bit-rates.
method Adversarial lossy video compression model minimizing an adversarial distortion objective.
result Reduction of perceptual artifacts and detail reconstruction under extreme compression.

The paper introduces a method to quantify uncertainty in neural networks without parametric assumptions.

problem Uncertainty quantification for neural network predictions.
method Nonparametric estimation of conditional label distribution using Nadaraya-Watson kernel.
result The method effectively disentangles aleatoric and epistemic uncertainties.

Study on predicting graph labels at nodes using local averaging and distance estimation.

problem Predicting graph labels at nodes given observations at other nodes.
method Local averaging and distance estimation methods for graph regression.
result Alternative methods can achieve standard nonparametric rates even when graph neighborhoods are too large or small.

It has been recently conjectured by Boyer-Gordon-Watson that a closed, orientable, irreducible 33-manifold MM is a Heegaard Floer LL-space if and only if π1(M)π_1(M) is not left-orderable. In this article, we study this conjecture from the point of view of lattice cohomology, an invariant introduced by Némethi which is…

2013-08-08abs ↗pdf ↗

New method compresses facial videos using GANs and latent space optimization.

problem Efficiently compressing facial videos at low bit rates.
method Leverages StyleGAN for latent space representation and compression, learns optimal compression through entropy model and perceptual loss.
result Significantly reduces perceptual distortion at low bit rates compared to state-of-the-art codecs.

Estimates time-series drifts from i.i.d. data using a direct Nadaraya-Watson plug-in method.

problem Nonparametric estimation of Schrödinger bridge drifts from single time interval data.
method Direct Nadaraya-Watson plug-in estimator based on kernelized numerator and denominator terms.
result Uniform non-asymptotic bound, CLT under undersmoothing, and adaptive bandwidth selector.

Conventional SVM-based image coding methods are founded on independently restricting the distortion in every image coefficient at some particular image representation. Geometrically, this implies allowing arbitrary signal distortions in an nn-dimensional rectangle defined by the ε\varepsilon-insensitivity zone in eac…

2013-10-18abs ↗pdf ↗

We introduce autoregressive implicit quantile networks (AIQN), a fundamentally different approach to generative modeling than those commonly used, that implicitly captures the distribution using quantile regression. AIQN is able to achieve superior perceptual quality and improvements in evaluation metrics, without incu…

2018-06-14abs ↗pdf ↗

Lossy compression algorithms are typically designed and analyzed through the lens of Shannon's rate-distortion theory, where the goal is to achieve the lowest possible distortion (e.g., low MSE or high SSIM) at any given bit rate. However, in recent years, it has become increasingly accepted that "low distortion" is no…

2019-01-23abs ↗pdf ↗

Boyer, Gordon, and Watson have conjectured that an irreducible rational homology 3-sphere is an L-space if and only if its fundamental group is not left-orderable. Since Dehn surgeries on knots in S3S^3 can produce large families of L-spaces, it is natural to examine the conjecture on these 3-manifolds. Greene, Lewalle…

2017-11-30abs ↗pdf ↗

This paper presents a novel CNN-based approach for synthesizing high-resolution LiDAR point cloud data. Our approach generates semantically and perceptually realistic results with guidance from specialized loss-functions. First, we utilize a modified per-point loss that addresses missing LiDAR point measurements. Secon…

2019-06-28abs ↗pdf ↗