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

119237356474 · Jun 202019922001200920172026
48 results for single example

StrokeCoder uses Transformers to generate images from single examples.

problem Creating diverse images from a single example.
method Transformer Neural Network learns from a single path-based example to generate a set of images.
result The model can generate a large set of deviated images that still represent the original image's style and concept.

New method defends against both single-step and iterative adversarial examples.

problem Defending against adversarial examples, especially iterative ones, is computationally expensive.
method Single-Step Adversarial Training (SST) with modifications.
result Our method outperforms state-of-the-art methods in both accuracy and training time.

Single gradient step finds adversarial examples in random neural networks.

problem Finding adversarial examples in neural networks with random architectures.
method Gradient descent approach applied to random undercomplete and overcomplete two-layers neural networks.
result A single gradient step is sufficient to find adversarial examples in random neural networks.

In recent years, the electrocardiogram (ECG) has seen a large diffusion in both medical and commercial applications, fueled by the rise of single-lead versions. Single-lead ECG can be embedded in medical devices and wearable products such as the injectable Medtronic Linq monitor, the iRhythm Ziopatch wearable monitor, …

2019-05-13abs ↗pdf ↗

Adversarial examples are malicious inputs designed to fool machine learning models. They often transfer from one model to another, allowing attackers to mount black box attacks without knowledge of the target model's parameters. Adversarial training is the process of explicitly training a model on adversarial examples,…

2016-11-04abs ↗pdf ↗

New examples of Lie algebras with ad-invariant metrics found.

problem Finding ad-invariant metrics on nonnice nilpotent Lie algebras.
method Introducing single extension method to construct Lie algebras with ad-invariant metrics.
result Explicit examples of nonnice nilpotent Lie algebras with ad-invariant metrics for dimensions > 10 and steps > 2.

Multi-head attention outperforms single-head in in-context linear regression tasks.

problem Comparing performance of transformer with single-/multi-head attention in in-context learning.
method Theoretical analysis of performance of transformers with different attention mechanisms in linear regression tasks.
result Multi-head attention with a substantial embedding dimension outperforms single-head attention in in-context linear regression tasks.

A gap in a paper of Rubinstein-Scharlemann is explored: new examples are found of closed orientable 3-manifolds with possibly multiple genus 2 Heegaard splittings. Properties common to all the examples in the original paper are not universally shared by the new examples: some of the new examples have Hempel distance 3,…

2009-10-20abs ↗pdf ↗

The family of embedded, singly periodic minimal surfaces of Riemann have as limit-surfaces the helicoid, the catenoid, a single plane, or an infinite set of equally-spaced parallel planes.

2008-06-28abs ↗pdf ↗

A complementary label (CL) simply indicates an incorrect class of an example, but learning with CLs results in multi-class classifiers that can predict the correct class. Unfortunately, the problem setting only allows a single CL for each example, which notably limits its potential since our labelers may easily identif…

2019-12-30abs ↗pdf ↗

New method certifies joint adversarial robustness of model ensembles.

problem Ensuring robustness of model ensembles against adversarial attacks.
method Proposes a novel technique to certify joint robustness, building on prior work on single-model robustness certification.
result Demonstrates the effectiveness of certifying joint robustness of ensembles, improving understanding of ensemble defenses.

Neural networks struggle with extrapolation, but a new framework allows them to learn counterfactual invariances.

problem Neural networks' inability to extrapolate beyond training data distribution.
method Introduces a learning framework that allows neural networks to extrapolate over group transformations based on counterfactual invariances.
result Neural networks can learn counterfactual invariances from a single environment, overcoming their limitations in extrapolation.

We provide in this note two relevant examples of Lagrangian cobordisms. The first one gives an example of two exact Lagrangian submanifolds which cannot be composed in an exact fashion. The second one is an example of an exact Lagrangian cobordism on which all primitive of the Liouville form is not constant on the nega…

2013-01-29abs ↗pdf ↗

By studying the example of smooth structures on CP^2#3(-CP^2) we illustrate how surgery on a single embedded nullhomologous torus can be utilized to change the symplectic structure, the Seiberg-Witten invariant, and hence the smooth structure on a 4-manifold.

2011-11-18abs ↗pdf ↗

Casson and Gordon gave the rectangle condition for strong irreducibility of Heegaard splittings [1]. We give a parity condition for irreducibility of Heegaard splittings of irreducible manifolds. As an application, we give examples of non-stabilized Heegaard splittings by doing a single Dehn twist.

2008-12-01abs ↗pdf ↗

Adversarial examples are slight perturbations that are designed to fool artificial neural networks when fed as an input. In this work the usability of the Fisher information for the detection of such adversarial attacks is studied. We discuss various quantities whose computation scales well with the network size, study…

2019-09-12abs ↗pdf ↗

Extending an example by Colding and Minicozzi, we construct a sequence of properly embedded minimal disks ΣiΣ_i in an infinite Euclidean cylinder around the x3x_3-axis with curvature blow-up at a single point. The sequence converges to a non smooth and non proper minimal lamination in the cylinder. Moreover, we show th…

2018-09-30abs ↗pdf ↗

Found first example of homogeneous gradient solitons for G2_2-Laplacian flow.

problem Existence of homogeneous gradient solitons for G2_2-Laplacian flow.
method Provided the first known example of homogeneous gradient solitons.
result G2_2-Laplacian flow admits homogeneous gradient solitons on one-dimensional extensions.

Mathematical properties of the historical GDP/cap distributions are discussed and explained. These distributions are frequently incorrectly interpreted and the Unified Growth Theory is an outstanding example of such common misconceptions. It is shown here that the fundamental postulates of this theory are contradicted …

2015-09-25abs ↗pdf ↗

In distributed statistical learning, NN samples are split across mm machines and a learner wishes to use minimal communication to learn as well as if the examples were on a single machine. This model has received substantial interest in machine learning due to its scalability and potential for parallel speedup. Howev…

2019-02-28abs ↗pdf ↗

Kuperberg [Algebr. Geom. Topol. 3 (2003) 587-591] has shown that a virtual knot corresponds (up to generalized Reidemeister moves) to a unique embedding in a thichened surface of minimal genus. If a virtual knot diagram is equivalent to a classical knot diagram then this minimal surface is a sphere. Using this result a…

2004-01-05abs ↗pdf ↗

Given knots K and J, one can ask whether a single smoothing of a crossing in a diagram for K can convert it into a diagram for J. As an interesting example, Zekovic discovered that the torus knot T(2,5) can be converted into T(2,-5) with a single smoothing. On the other hand, Moore and Vasquez have shown that among tor…

2018-09-20abs ↗pdf ↗

We provide single-model estimates of aleatoric and epistemic uncertainty for deep neural networks. To estimate aleatoric uncertainty, we propose Simultaneous Quantile Regression (SQR), a loss function to learn all the conditional quantiles of a given target variable. These quantiles can be used to compute well-calibrat…

2018-11-02abs ↗pdf ↗

New offline RL method handles average-reward MDPs with single-policy coverage.

problem Challenges in offline reinforcement learning due to distribution shift and non-uniform coverage.
method Develops an algorithm based on pessimistic discounted value iteration with quantile clipping.
result First fully single-policy sample complexity bound for average-reward offline RL.

Study on indexability of restless multi-armed bandits and rollout policy performance.

problem Maximizing discounted rewards in finite state restless multi-armed bandit problems.
method Decouple the problem into single-armed restless bandits, analyze using value iteration, and compare with Whittle index policy.
result Demonstrates conditions for indexability and compares performance of index policy and rollout policy.

We provide the asymptotic distribution of the major indexes used in the statistical literature to quantify disparate treatment in machine learning. We aim at promoting the use of confidence intervals when testing the so-called group disparate impact. We illustrate on some examples the importance of using confidence int…

2018-07-17abs ↗pdf ↗

In this paper we prove that the limit set of any Weil-Petersson geodesic ray with uniquely ergodic ending lamination is a single point in the Thurston compactification of Teichmüller space. On the other hand, we construct examples of Weil-Petersson geodesics with minimal nonuniquely ergodic ending laminations and limit…

2016-11-07abs ↗pdf ↗

We develop a way of seeing a complete orientable hyperbolic 44-manifold M\mathcal{M} as an orbifold cover of a Coxeter polytope PH4\mathcal{P} \subset \mathbb{H}^4 that has a facet colouring. We also develop a way of finding totally geodesic sub-manifolds N\mathcal{N} in M\mathcal{M}, and describing the result of mu…

2015-07-09abs ↗pdf ↗

A depth surface of E^3 is a range image observed from a single view can be represented by a digital graph (Monge patch) surface . That is, a depth or range value at a point (u,v) is given by a single valued function z=f(u,v). In the present study we consider the surfaces in Euclidean 4-space E^4 given with a Monge patc…

2013-05-19abs ↗pdf ↗