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

75149224298 · Jun 202019922001200920172026
48 results for symplectic-type examples

Local equivalence found between certain solitons and generalized Kähler-Ricci solitons.

problem Understanding and constructing generalized Kähler-Ricci solitons.
method Establishing local equivalence and extending to complete GKRS under natural conditions.
result Local classification and construction of new examples in all dimensions, especially in four dimensions.

The paper studies automorphisms of generalized Kähler manifolds and their Lie algebras.

problem Understanding the existence or non-existence of generalized Kähler structures with constant scalar curvature.
method Analyzing the Lie algebra of automorphisms of generalized complex manifolds under specific conditions.
result The Lie algebra of automorphisms is reductive if a generalized Kähler structure of symplectic type with constant scalar curvature exists.

Anti-diagonal toric generalized Ka¨\ddot{a}hler structures of symplectic type on a compact toric symplectic manifold were investigated in \cite{Wang2} . In this article, we consider \emph{general} toric generalized Ka¨\ddot{a}hler structures of symplectic type, without requiring them to be anti-diagonal. Such a structu…

2018-11-14abs ↗pdf ↗

We solve the problem of determining the fundamental degrees of freedom underlying a generalized Kähler structure of symplectic type. For a usual Kähler structure, it is well-known that the geometry is determined by a complex structure, a Kähler class, and the choice of a positive (1,1)(1,1)-form in this class, which depen…

2018-04-15abs ↗pdf ↗

The ordinary (or classical) Birman-Wenzl-Murakami algebras were initially conceived as an algebraic framework for the Kauffman link invariant. They also appear as centralizer algebras for representations of quantum universal enveloping algebras of orthogonal or symplectic types. It was shown by Morton and Wassermann th…

2004-11-07abs ↗pdf ↗

We construct a model space $C(\gsp(\bR^{2n}))$ for the variety of Abelian simply transitive groups of affine transformations of type ${\rm Sp}(\bR^{2n})$. The model is stratified and its principal stratum is a Zariski-open subbundle of a natural vector bundle over the Grassmannian of Lagrangian subspaces in $\bR^{2n}$.…

2001-05-03abs ↗pdf ↗

The reduced norm-one group G of a central simple algebra is an inner form of the special linear group, and an involution on the algebra induces an automorphism of G. We study the action of such automorphisms in the cohomology of arithmetic subgroups of G. The main result is a precise formula for Lefschetz numbers of au…

2013-02-05abs ↗pdf ↗

Study of Kähler-Ricci flow on toric Fano varieties with preserved symplectic condition.

problem Analyzing the generalized Kähler-Ricci flow on toric Fano varieties.
method Establishing global existence, deriving entropy and energy functionals.
result Convergence of nonsingular solutions at infinity and weak convergence of the flow.

This is a sequel of \cite{Wang}, which provides a general formalism for this paper. We mainly investigate thoroughly a subclass of toric generalized Ka¨\ddot{a}hler manifolds of symplectic type introduced by Boulanger in \cite{Bou}. We find torus actions on such manifolds are all \emph{strong Hamiltonian} in the sense …

2018-10-18abs ↗pdf ↗

We characterize N=1 vacua of type II theories in terms of generalized complex structure on the internal manifold M. The structure group of T(M) + T*(M) being SU(3) x SU(3) implies the existence of two pure spinors Phi_1 and Phi_2. The conditions for preserving N=1 supersymmetry turn out to be simple generalizations of …

2005-05-24abs ↗pdf ↗

With rapid progress and significant successes in a wide spectrum of applications, deep learning is being applied in many safety-critical environments. However, deep neural networks have been recently found vulnerable to well-designed input samples, called adversarial examples. Adversarial examples are imperceptible to …

2017-12-19abs ↗pdf ↗

Cincer cleans both new and past data by identifying and relabeling suspicious and counter-examples.

problem Sequential learning under label noise, especially in applications with human supervision.
method Cincer uses example-based explanations to identify and relabel suspicious and counter-examples, leveraging Fisher information matrix approximation.
result Cincer achieves better data and models by clarifying the model's suspicions, especially with FIM approximation.

Proposes BATer for improved adversarial example detection.

problem Detecting adversarial examples in neural networks.
method Introduces a Bayesian adversarial example detector (BATer) using random components in a Bayesian neural network.
result BATer outperforms state-of-the-art detectors in adversarial example detection.

We consider learning problems where the training set consists of two types of examples: private and public. The goal is to design a learning algorithm that satisfies differential privacy only with respect to the private examples. This setting interpolates between private learning (where all examples are private) and cl…

2019-10-25abs ↗pdf ↗

Catastrophic forgetting of connectionist neural networks is caused by the global sharing of parameters among all training examples. In this study, we analyze parameter sharing under the conditional computation framework where the parameters of a neural network are conditioned on each input example. At one extreme, if e…

2019-06-16abs ↗pdf ↗

RelatIF selects more intuitive training examples for explaining model predictions.

problem Influence functions identify outliers as explanatory examples, leading to poor explanations.
method RelatIF separates global and local influence, optimizing for local relative to global effects.
result Examples selected by RelatIF are more intuitive than those from influence functions.

Recent studies show that widely used deep neural networks (DNNs) are vulnerable to carefully crafted adversarial examples. Many advanced algorithms have been proposed to generate adversarial examples by leveraging the Lp\mathcal{L}_p distance for penalizing perturbations. Researchers have explored different defense met…

2018-01-08abs ↗pdf ↗

Algorithm learns from both labeled and arbitrary test examples, giving guarantees for bounded VC dimension classes.

problem Learning from arbitrary test examples, not just perturbations.
method Selective transductive learning algorithm that outputs abstaining predictions.
result Nontrivial guarantees for bounded VC dimension classes with arbitrary train and test distributions.

When learning a new concept, not all training examples may prove equally useful for training: some may have higher or lower training value than others. The goal of this paper is to bring to the attention of the vision community the following considerations: (1) some examples are better than others for training detector…

2013-11-25abs ↗pdf ↗

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.

The paper analyzes how forgetting in LLMs is linked to simple task-upstream example associations.

problem Forgetting of upstream knowledge in fine-tuned LLMs.
method Empirical analysis of forgotten examples in NN upstream examples after MM new tasks, using low-rank matrix approximation.
result Forgetting can be predicted efficiently using matrix completion over empirical associations.

New examples of manifolds with positive scalar curvature and infinitely many poles.

problem Constructing manifolds with positive scalar curvature and understanding their limits.
method Extending previous examples to create new sequences of manifolds.
result Found new examples of manifolds with infinitely many poles and positive scalar curvature.

This study explores how examples influence ICL in LLMs.

problem Understanding how examples impact in-context learning in large language models.
method Theoretical study with a probabilistic model extending from Gaussian mixture model.
result The impact of pre-training knowledge and examples on ICL prediction accuracy.

In many classification problems unlabelled data is abundant and a subset can be chosen for labelling. This defines the context of active learning (AL), where methods systematically select that subset, to improve a classifier by retraining. Given a classification problem, and a classifier trained on a small number of la…

2014-07-30abs ↗pdf ↗

Deep networks prioritize easier examples over harder ones, leading to faster training.

problem Understanding how deep networks prioritize examples of varying difficulty.
method Investigated the effect of linear vs non-linear learning modes on example difficulty.
result Non-linear dynamics tend to sequentialize the learning of examples of increasing difficulty.

Method trains deep models to explain predictions with fewer examples.

problem Difficulty in humans understanding deep model predictions.
method Simultaneously trains prediction and explanation models with sparse regularization.
result Improves faithfulness of explanations with fewer examples while maintaining predictive performance.

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 ↗

We study the problem of reducing the amount of labeled training data required to train supervised classification models. We approach it by leveraging Active Learning, through sequential selection of examples which benefit the model most. Selecting examples one by one is not practical for the amount of training examples…

2019-01-17abs ↗pdf ↗

We propose a method to generate audio adversarial examples that can attack a state-of-the-art speech recognition model in the physical world. Previous work assumes that generated adversarial examples are directly fed to the recognition model, and is not able to perform such a physical attack because of reverberation an…

2018-10-28abs ↗pdf ↗