Paper identifies and solves a 'scrambled translation' issue in UNMT models.
problem Scrambled translation in UNMT models using word shuffle noise.
method Retraining UNMT models without noise after a pre-defined number of iterations.
result Retraining strategy improves BLEU scores by 10-20% on various language pairs.
Quantum systems with scrambling improve temporal information processing, but scaling requires exponential overhead.
problem Scalability and memory retention of quantum reservoirs in temporal information processing.
method Examined a quantum reservoir processing framework with scrambling reservoirs modeled by high-order unitary designs, analyzed in noiseless and noisy settings.
result Memory retention improves exponentially with reservoir size but worsens with reservoir iterations, requiring exponential shot overhead for scaling.
In this paper, we study CAT(0) groups and Coxeter groups whose boundaries are scrambled sets. Suppose that a group G acts geometrically (i.e. properly and cocompactly by isometries) on a CAT(0) space X. (Such group G is called a {\it CAT(0) group}.) Then the group G acts by homeomorphisms on the boundary $\part…
RQMC improves QMC by providing practical error bounds for financial applications.
problem Lack of practical error estimates in QMC methods.
method Combines Sobol LDS with randomized scrambling methods.
result RQMC outperforms standard QMC in convergence rates and provides error bounds.
Convolutional networks outperform shallow classifiers on certain tasks due to hierarchical structure.
problem Understanding why convolutional networks outperform shallow classifiers on specific tasks.
method Approximation theory, visual tasks with deterministic scrambling, and network performance evaluation.
result Hierarchical structure is crucial for convolutional networks' performance on certain tasks, but not all.
New neural network approximates convex option prices.
problem Approximating prices of options with convex payoffs.
method Input Convex Neural Network (ICNN) architecture, with a scrambling phase.
result Validated convergence and effectiveness in estimating option prices.
DNA rearrangement processes recombine gene segments that are organized on the chromosome in a variety of ways. The segments can overlap, interleave or one may be a subsegment of another. We use directed graphs to represent segment organizations on a given locus where contigs containing rearranged segments represent ver…
Novel algorithm estimates local permutations in unlabeled multi-view sensing.
problem Estimating local permutations in unlabeled multi-view sensing.
method Graph alignment and Gromov-Wasserstein alignment exploiting multiple views.
result The proposed algorithm is scalable and applicable to challenging SNR regimes.
We demonstrate that the gain/loss asymmetry observed for stock indices vanishes if the temporal dependence structure is destroyed by scrambling the time series. We also show that an artificial index constructed by a simple average of a number of individual stocks display gain/loss asymmetry - this allows us to explicit…
In this paper we introduce a new neural architecture for sorting unordered sequences where the correct sequence order is not easily defined but must rather be inferred from training data. We refer to this architecture as OrderNet and describe how it was constructed to be naturally permutation equivariant while still al…
Model shows liquidity stress crossover in market dynamics.
problem Identifying genuine market instabilities in agent-based models.
method Applied Bouchaud's phase-diagram method to a continuous-double-auction model.
result Emergent liquidity-stress crossover with specific tipping point parameters.
One of the biggest challenges in the field of biomedical imaging is the comprehension and the exploitation of the photon scattering through disordered media. Many studies have pursued the solution to this puzzle, achieving light-focusing control or reconstructing images in complex media. In the present work, we investi…
Background: A universal unanswered question in neuroscience and machine learning is whether computers can decode the patterns of the human brain. Multi-Voxels Pattern Analysis (MVPA) is a critical tool for addressing this question. However, there are two challenges in the previous MVPA methods, which include decreasing…
A universal unanswered question in neuroscience and machine learning is whether computers can decode the patterns of the human brain. Multi-Voxels Pattern Analysis (MVPA) is a critical tool for addressing this question. However, there are two challenges in the previous MVPA methods, which include decreasing sparsity an…
Empirical law predicts accuracy of Google Translate's translation chains.
problem Predicting accuracy in machine translation with multiple hops.
method Empirical testing of Google Translate's sequential translation.
result Accuracy decreases with the number of translating hops, following a power law.
The authors of (Cho et al., 2014a) have shown that the recently introduced neural network translation systems suffer from a significant drop in translation quality when translating long sentences, unlike existing phrase-based translation systems. In this paper, we propose a way to address this issue by automatically se…
Paper proposes a method to learn word translations bidirectionally.
problem Word translation between languages.
method Jointly learns translations in both directions with minimal supervision.
result Improves accuracy of translations over previous methods.
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.
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…
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.
Researchers classify and describe Kα-translators in Euclidean space.
problem Classifying and describing Kα-translators in Euclidean space. method Rotationally symmetric and helicoidal motions.
result For each α, there is a Kα-translator intersecting orthogonally the rotation axis. The quality of machine translation is rapidly evolving. Today one can find several machine translation systems on the web that provide reasonable translations, although the systems are not perfect. In some specific domains, the quality may decrease. A recently proposed approach to this domain is neural machine translat…
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.
Classifies and constructs translators for curvature flows.
problem Understanding translating solitons in curvature flows.
method Developed rotational theory, introduced signed-neck framework.
result Classified and constructed catenoidal-type translators.
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 Qn−1-translators in Rn+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.
Study classifies translators for mean curvature flow in 3D.
problem Classifying semigraphical translators for mean curvature flow in R3. method Morse-Radó theory and angular maximum principle.
result No solution to the translator equation on the upper half-plane with alternating boundary values.
Study on singular points of translation surfaces under linearly dependent conditions.
problem Investigate singular points of translation surfaces under linearly dependent conditions.
method Use theories of generalised framed surfaces and framed surfaces.
result Introduce translation generalised framed surfaces and investigate their singular points.
Proves uniqueness of translators in 3D space.
problem Uniqueness of pitchfork and helicoid translators in mean curvature flow.
method Arc-counting argument and rotational maximum principle.
result Proves conjecture on uniqueness of translators.
An NMT system for Indic languages outperforms Google Translate.
problem Challenges in translating Indic languages efficiently.
method Encoder-decoder with attention mechanism for neural machine translation.
result Outperforms Google Translate with a 6 BLEU score margin on English-Gujarati translation.
New families of translation surfaces with multiple oblivious points discovered.
problem Identifying points on translation surfaces without nearby closed geodesics.
method Constructing new families of translation surfaces and proving existence in higher genera.
result Translation surfaces in every genus ≥3 have at least one oblivious point.
In this article we prove two non-existence results for translating solitons of the mean curvature flow (translators for short) in Rm+1. We also obtain an upper bound to the maximum height that a compact embedded translator in R3 can achieve. On the other hand, we study graphical perturbation…
This paper classifies grim reapers in a specific product space.
problem Classifying grim reapers in a product space.
method Analyzing mean curvature flow and translations in $\h^2 imes
$.
result A full classification of grim reapers in $\h^2 imes
$.
Neural machine translation is a recently proposed approach to machine translation. Unlike the traditional statistical machine translation, the neural machine translation aims at building a single neural network that can be jointly tuned to maximize the translation performance. The models proposed recently for neural ma…
Study invariant λ-translators in Lorentz-Minkowski space.
problem Characterize λ-translators invariant under translations and rotations. method Analyze 1-parameter group of translations and rotations, find explicit parametrizations, and solve non-linear autonomous systems.
result Explicit parametrizations and qualitative properties of invariant λ-translators. Unique minimal translation surfaces found in Heisenberg group.
problem Classifying minimal translation surfaces in Heisenberg group.
method Complete classification through generating curves analysis.
result Uniqueness of minimal translation surfaces up to isometries.
Study classifies and characterizes translators in hyperbolic static universe.
problem Classifying and characterizing translators in hyperbolic static universe.
method Classified and characterized translators foliated by horospheres and rotationally invariant ones, both space-like and time-like.
result Obtained a characterization of the bowl and certain translators foliated by horospheres.
The study proves stability of various graphical translators in mean curvature flow.
problem Stability of graphical translators in mean curvature flow.
method Existence of longtime solution to mean curvature flow, dynamical stability results for various graphical translators.
result Dynamical stability of various types of graphical translators.
Study translators in Generalised Robertson-Walker spacetimes, identifying warping functions and classifying examples.
problem Understanding translators in Generalised Robertson-Walker spacetimes.
method Analyzing translators as submanifolds satisfying the mean curvature flow equation with a specific vector field.
result Identification of three one-parameter families of warping functions and classification of translators.
LeJEPA learns latent variables from nonlinear observations.
problem Learning latent variables from nonlinear observations.
method Proves linear identifiability of Gaussian latent distributions.
result Gaussian distribution uniquely guarantees linear identifiability.
The paper shows how integrating categorical semantics can enhance unsupervised domain translation.
problem Improving unsupervised domain translation between perceptually different domains.
method Learning invariant categorical semantic features in an unsupervised manner and conditioning them on the style encoder.
result Conditioning the style encoder on learned categorical semantics improves translation and stylization.
The paper explores new translating solitons and their relation to Δ-wings.
problem Understanding translating solitons and their properties.
method Description of new annular examples and proving related results.
result Proves several results about translating solitons and their relation to Δ-wings. African languages are numerous, complex and low-resourced. The datasets required for machine translation are difficult to discover, and existing research is hard to reproduce. Minimal attention has been given to machine translation for African languages so there is scant research regarding the problems that arise when …
Study shows only grim reaper cylinder for certain self-translating surfaces.
problem Characterizing self-translating surfaces in 3D space.
method Used parabolicity in a weighted setting and universally L-superharmonic functions.
result Characterized the grim reaper cylinder as the only finite entropy self-translating 2-surface in R^3 of width π and bounded from below.
Study proves conditions for translating solitons to be planar.
problem Conditions for translating solitons to be planar.
method Investigates translating solitons as sums and products of curves, extends results to Lorentz-Minkowski space.
result Translating solitons can be planar if one component is planar.
We study volume growth, entropy and stability for translating solitons of mean curvature flow. First, we prove that every complete properly immersed translator has at least linear volume growth. Then, by using Huisken's monotonicity formula, we compute the entropy of the grim reaper and the bowl solitons. We also give …