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.

169,051 papers · 148 categories

Trend · papers per month

6.3%12.5%18.8%25.0% · Jul 199319922001200920172026
48 results for Translation Errors

Paper tackles NAT translation issues with auxiliary regularization.

problem Improves NAT translation quality by addressing repeated and incomplete translations.
method Improves decoder hidden representations via two auxiliary regularization terms.
result Significant improvement in NAT model accuracy with better inference efficiency.

The paper proves impossibilities and positive results for universal machine translation.

problem Learning shared sentence representations across multiple language pairs.
method Formal proofs and analysis of natural generative processes.
result Lower bound on translation error and positive results under natural structure.

Improves NMT by sampling context from predicted sequence during training.

problem Error accumulation and overcorrection in NMT due to mismatched training and inference contexts.
method Samples context words from both ground truth and predicted sequences during training.
result Significant improvements on multiple datasets, including Chinese->English and WMT'14 English->German.

A new loss function speeds up sequence-to-sequence models for continuous outputs.

problem Slow and memory-intensive softmax layer limits vocabulary size and translation quality.
method Proposes a probabilistic loss and continuous embedding layer training/inference procedure.
result Models achieve up to 2.5x speed-up in training time with similar translation quality.

New method certifies images against transformations like rotations and translations.

problem Certifying robustness of images against transformations like rotations and translations.
method Randomized smoothing with three different kinds of defenses.
result Individual certificates can be obtained via statistical error bounds or efficient online inverse computation.

This paper has been withdrawn by the author due to a crucial sign error in equation 1. An isometry ρρ of a connected Finsler space (M,F)(M, F) is called bounded if the function d(x,ρ(x))d(x, ρ(x)) is bounded on MM. It is called a Clifford-Wolf translation if the function d(x,ρ(x))d(x, ρ(x)) is constant on MM. In this paper, we prove…

2012-04-23abs ↗pdf ↗

Improved GEC models use scored data from large pretraining to outperform.

problem Addressing data sparsity in Grammatical Error Correction.
method Derive example-level scores from a smaller, higher-quality dataset and incorporate delta-log-perplexity into training schedules.
result Models trained on scored data achieve state-of-the-art results.

New method uses non-translation invariant risk measures for fair financial derivative pricing.

problem Inequalities in financial derivative pricing under traditional risk measures.
method Deep reinforcement learning with modified deep hedging algorithm.
result Effective pricing of financial derivatives without price inflation.

We propose SEARNN, a novel training algorithm for recurrent neural networks (RNNs) inspired by the "learning to search" (L2S) approach to structured prediction. RNNs have been widely successful in structured prediction applications such as machine translation or parsing, and are commonly trained using maximum likelihoo…

2017-06-14abs ↗pdf ↗

Paper advances sparse regularisation theory for measures with new kernel insights.

problem Estimating sparse measures from noisy observations using continuous sparse regularisation.
method Develops new continuous sparse regularisation theory on measures with Beurling-LASSO, introduces kernel switch analysis.
result Proves the ``sinc-4'' kernel satisfies a technical LPC assumption for error bounds.

Deep learning models have lately shown great performance in various fields such as computer vision, speech recognition, speech translation, and natural language processing. However, alongside their state-of-the-art performance, it is still generally unclear what is the source of their generalization ability. Thus, an i…

2018-08-03abs ↗pdf ↗

The study analyzes prediction errors in systems with memory kernels, providing bounds and stability results.

problem Prediction errors in stochastic dynamical systems with memory kernels.
method Analysis of generalized Langevin equations (GLEs) with Volterra equations, integrating synchronized noise coupling and weighted norms.
result Prediction discrepancies decay at a rate determined by the memory kernel's decay, quantitatively bounded by kernel estimation errors.

The paper provides bounds on estimation error in a distributed online learning setting.

problem Estimating an unknown parameter in a distributed and online manner with finite sample guarantees.
method Proposes a distributed online estimation algorithm that improves accuracy through communication, providing non-asymptotic bounds on estimation error.
result Demonstrates a trade-off between estimation error and communication costs, and determines a stopping time for communication based on desired accuracy.

We present an autoencoder that leverages learned representations to better measure similarities in data space. By combining a variational autoencoder with a generative adversarial network we can use learned feature representations in the GAN discriminator as basis for the VAE reconstruction objective. Thereby, we repla…

2015-12-31abs ↗pdf ↗

Sharp bounds for approximating Sobolev functions by ridge functions and networks.

problem Approximating Sobolev functions with multivariate ridge functions and networks.
method Proving sharp upper and lower bounds for approximation order.
result Order of approximation asymptotically behaves as nr/(d)n^{-r/(d-\ell)}.

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.

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.

Transformer models align words through attention weights, closely approximating Optimal Transport.

problem Understanding the internal mechanism of transformer models in language processing.
method Empirical evidence and theoretical analysis of attention weights and their relation to Optimal Transport.
result Transformer models can simulate gradient descent on the dual of entropy-regularized OT problem, providing a theoretical foundation for token alignment.

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 ↗

Bayesian deep learning improves seismic imaging uncertainty.

problem Uncertainty in seismic imaging due to data noise and linearization errors.
method Combines Bayesian inference and deep neural networks to quantify uncertainty in horizon tracking.
result Uncertainty in automatically tracked horizons can be quantified and visualized.

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.

ResNet-type CNNs achieve optimal error rates in function classes with block-sparse structures.

problem Optimal approximation and estimation in function classes with sparse constraints.
method Developed ResNet-type CNNs that can approximate and estimate functions with block-sparse structures.
result ResNet-type CNNs attain minimax optimal error rates in Hölder and Barron classes.

Neural machine translation models trained for 5 South African languages.

problem Lack of resources and research for machine translation in African languages.
method Training neural machine translation models for 5 South African languages using modern techniques.
result Promises of neural machine translation for African languages.

Study measures gender bias in machine translation using multiple reference points.

problem Measuring and identifying gender bias in machine translation.
method Used an optimal non-biased translator, reference points from occupational statistics and survey.
result Found bias against both genders, but more against women, and found occupations have a greater effect than adjectives.

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.

Paper finds a non-existence theorem for certain translators in high dimensions.

problem Non-existence of certain translators in high-dimensional spaces.
method Developed a non-existence theorem and found an example of a translator.
result Non-existence of entire Qn1Q_{n-1}-translators in Rn+1\mathbb{R}^{n+1}.

Constructing translating solitons from Lagrangian Grim Reapers.

problem Creating Lagrangian translating solitons from intersections of Grim Reapers.
method Desingularizing intersections with special Lagrangian Lawlor necks.
result Constructing Lagrangian translating solitons with multiple ends and loops.