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

20406080 · Jun 202019922001200920172026
48 results for back translation

Forward translation improves neural machine translation for sentences originally in source language.

problem Improving neural machine translation quality using synthetic data.
method Case study with French-English news translation, separating test sets by original language, analyzing domains, translationese, and noise.
result Forward translation delivers superior gains on sentences originally in source language, complementing back-translation on target language sentences.

This paper uses LLMs and cycle consistency for better machine translation evaluation.

problem Evaluating translation quality and LLM capabilities without ground truth.
method Generate translation candidates, back-translate, and evaluate cycle consistency.
result Larger LLMs or more inference passes improve cycle consistency.

Let SO+(p,q)\mathrm{SO}^+(p,q) denote the identity connected component of the real orthogonal group with signature (p,q)(p,q). We give a complete description of the spaces of continuous and generalized translation- and SO+(p,q)\mathrm{SO}^+(p,q)-invariant valuations, generalizing Hadwiger's classification of Euclidean isometry-invari…

2016-02-28abs ↗pdf ↗

The authors examine the concept of probability of default for asset-backed loans. In contrast to unsecured loans it is shown that probability of default can be defined as either a measure of the likelihood of the borrower failing to make required payments, or as the likelihood of an insufficiency of collateral value on…

2013-06-28abs ↗pdf ↗

CERT improves language understanding by contrastively learning sentence-level semantics.

problem Lack of sentence-level semantics in existing pretraining tasks.
method Contrastive self-supervised learning at the sentence level using back-translation augmentations.
result CERT outperforms BERT on 7 out of 11 GLUE benchmark tasks, achieving the same performance as BERT on 2 tasks.

The paper explores dual learning, a technique that improves machine translation and image transformation.

problem Understanding and improving dual learning's effectiveness and conditions.
method Theoretical analysis and algorithmic extension of dual learning.
result Multi-step dual learning boosts performance under mild conditions.

We generalize the natural cross ratio on the ideal boundary of a rank one symmetric spaces, or even CAT(1)\mathrm{CAT}(-1) space, to higher rank symmetric spaces and (non-locally compact) Euclidean buildings - we obtain vector valued cross ratios defined on simplices of the building at infinity. We show several properties …

2017-01-31abs ↗pdf ↗

In this work, we address the problem of modifying textual attributes of sentences. Given an input sentence and a set of attribute labels, we attempt to generate sentences that are compatible with the conditioning information. To ensure that the model generates content compatible sentences, we introduce a reconstruction…

2018-11-03abs ↗pdf ↗

Let XX be a real-analytic manifold and g ⁣:XRng\colon X\to{\mathbf R}^n a proper triangulable subanalytic map. Given a subanalytic rr-form ωω on XX whose pull-back to every non singular fiber of gg is exact, we show tha ωω has a relative primitive: there is a subanalytic (r1)(r-1)-form ΩΩ such that dgΛ(ωdΩ)=0dgΛ(ω-dΩ)=0. The p…

2010-02-08abs ↗pdf ↗

Generalising well in supervised learning tasks relies on correctly extrapolating the training data to a large region of the input space. One way to achieve this is to constrain the predictions to be invariant to transformations on the input that are known to be irrelevant (e.g. translation). Commonly, this is done thro…

2018-08-16abs ↗pdf ↗

This paper proposes an alternating back-propagation algorithm for learning the generator network model. The model is a non-linear generalization of factor analysis. In this model, the mapping from the continuous latent factors to the observed signal is parametrized by a convolutional neural network. The alternating bac…

2016-06-28abs ↗pdf ↗

The vast majority of successful deep neural networks are trained using variants of stochastic gradient descent (SGD) algorithms. Recent attempts to improve SGD can be broadly categorized into two approaches: (1) adaptive learning rate schemes, such as AdaGrad and Adam, and (2) accelerated schemes, such as heavy-ball an…

2019-07-19abs ↗pdf ↗

Kernel Multigrid accelerates Back-fitting for additive Gaussian Processes.

problem Slow convergence of Back-fitting in training additive Gaussian Processes.
method Kernel Packets (KP) and Sparse Gaussian Process Regression (GPR) to enhance Back-fitting.
result Kernel Multigrid reduces the required iterations to O(logn)\mathcal{O}(\log n).

We prove a Bochner type vanishing theorem for compact complex manifolds YY in Fujiki class C\mathcal C, with vanishing first Chern class, that admit a cohomology class [α]H1,1(Y,R)[α] \in H^{1,1}(Y,\mathbb R) which is numerically effective (nef) and has positive self-intersection (meaning Yαn>0\int_Y α^n \,>\, 0, where $n\,=\,\di…

2019-01-09abs ↗pdf ↗

As traditional neural network consumes a significant amount of computing resources during back propagation, \citet{Sun2017mePropSB} propose a simple yet effective technique to alleviate this problem. In this technique, only a small subset of the full gradients are computed to update the model parameters. In this paper …

2017-09-18abs ↗pdf ↗

Generalizes bits back coding for time-series models with latent Markov structures.

problem Efficiently compressing time-series data with latent Markov structures.
method Extends bits back coding to time-series models with latent Markov structures, including HMMs and LGSSMs.
result Effective for small scale models, promising for larger scale settings like video compression.

We show how to restructure the counterparty risk faced by the originator of a securitization or covered bond arising from an interest rate hedging swap assisted by a "one-way" collateral agreement. This risk emerges when the swap is negotiated between the special purpose vehicle and a third party that covers itself thr…

2013-10-26abs ↗pdf ↗

The back-propagation algorithm is the cornerstone of deep learning. Despite its importance, few variations of the algorithm have been attempted. This work presents an approach to discover new variations of the back-propagation equation. We use a domain specific lan- guage to describe update equations as a list of primi…

2018-08-08abs ↗pdf ↗

We define the pull-back of a smooth principal fibre bundle, and show that it has a natural principal fibre bundle structure. Next, we analyse the relationship between pull-backs by homotopy equivalent maps. The main result of this article is to show that for a principal fibre bundle over a paracompact manifold, there i…

2001-05-19abs ↗pdf ↗

Interpretable representations improve explainable AI by translating complex data into understandable concepts.

problem Many explainers use interpretable representations but overlook their full potential and assumptions.
method An in-depth analysis of interpretable representations for tabular, image, and text data, identifying strengths, weaknesses, and desiderata.
result Linear model quantifies interpretable concepts' influence on black-box predictions, revealing their explanatory properties and manipulability.

We present a voice conversion solution using recurrent sequence to sequence modeling for DNNs. Our solution takes advantage of recent advances in attention based modeling in the fields of Neural Machine Translation (NMT), Text-to-Speech (TTS) and Automatic Speech Recognition (ASR). The problem consists of converting be…

2019-07-15abs ↗pdf ↗

Under a pulled-back approach given in [1] and firstly presented in [2], we introduce, in this paper, the concepts of almost contact and normal almost contact Finsler structures on the pulled-back bundle. Properties of structures partly Sasakians are studied. Using the hh-curvature tensor of Chern connection given in [2…

2016-04-19abs ↗pdf ↗

Task-agnostic data augmentation shows little benefit for pretrained transformers.

problem Evaluating the effectiveness of task-agnostic data augmentation on pretrained transformers.
method Conducted a systematic examination of two data augmentation techniques (Easy Data Augmentation and Back-Translation) across 5 tasks, 6 datasets, and 3 pretrained transformer models.
result Data augmentation techniques previously effective for non-pretrained models fail to consistently improve performance for pretrained transformers, even with limited training data.

The paper constructs a multi-valued inverse of quasiregular maps and develops pull-back theory for differential forms.

problem Understanding multi-valued inverses of quasiregular maps and their properties.
method Using Almgren's framework of multi-valued maps and developing pull-back theory for differential forms.
result The multi-valued inverse is a quasiregular ωω-curve with respect to a natural nn-form ωω.

It is shown by several authors going back to Huisken-Yau that asymptotically Schwarzschildean time-slices possess a unique foliation by stable constant mean curvature (CMC) spheres defining the so-called CMC center of mass. We analyze how the leaves of this foliation evolve in time under the Einstein equations. More pr…

2013-12-21abs ↗pdf ↗

Study on rigidity of translating hypersurfaces not in graphical direction.

problem Rigidity of translating hypersurfaces not in graphical direction.
method Proved rigidity results for complete graphical translating hypersurfaces under specific conditions.
result Entire graphical translating surfaces are flat under certain conditions.

Narasihman and Ramanan proved that an arbitrary connection in a vector bundle over a base space B can be obtained as the pull-back (via a correctly chosen classifying map from B into the appropriate Grassmannian) of the universal connection in the universal bundle over the Grassmannian. The purpose of this paper is to …

2014-05-27abs ↗pdf ↗

This study examines the execution phase of corporate share buy-backs, highlighting inefficiencies and costs.

problem Lack of research on share buy-back execution practices and associated costs.
method Comparative analysis of execution practices and fees charged to corporations and investors.
result Uncovered inefficiencies and frictional costs in share buy-back executions, advocating for transparency and fairness.

The natural automorphism group of a translation surface is its group of translations. For finite translation surfaces of genus g > 1 the order of this group is naturally bounded in terms of g due to a Riemann-Hurwitz formula argument. In analogy with classical Hurwitz surfaces, we call surfaces which achieve the maxima…

2013-11-28abs ↗pdf ↗

Paper introduces a new risk measure for multivariate residual estimation.

problem Quantifying residual estimation risk in complex financial models.
method Developed a multivariate framework for residual estimation risk, defined using various risk measures, and proposed a back-testing criterion.
result Demonstrated the effectiveness of the new measure through back-testing on retail credit portfolios.

Study on stable translation lengths of surface homeomorphisms and their approximations.

problem Understanding stable translation lengths of homeomorphisms and their finite approximations.
method Comparing stable translation lengths of homeomorphisms and their finite approximations on curve graphs.
result Stable translation length of homeomorphisms with dense periodic points equals the supremum of their approximations.