This work improves NAT translation accuracy through fine-tuning with curriculum learning.
problem Improving NAT translation accuracy while maintaining inference speed.
method Curriculum learning applied to fine-tuning of a pre-trained AT model to a NAT model.
result Significant improvement in translation accuracy (over 1 BLEU score) and speedup in inference.
As a new neural machine translation approach, Non-Autoregressive machine Translation (NAT) has attracted attention recently due to its high efficiency in inference. However, the high efficiency has come at the cost of not capturing the sequential dependency on the target side of translation, which causes NAT to suffer …
NATS-Bench benchmarks NAS algorithms for architecture topology and size.
problem Incomparable performance of NAS algorithms due to different search spaces and training setups.
method Unified benchmarking platform for architecture topology and size searching.
result Validated benchmark for 15,625 topology and 32,768 size candidates.
NAT optimizes neural architectures to improve performance without extra cost.
problem Redundant operations in neural architectures consume memory and degrade performance.
method Transformed Markov Decision Process (MDP) and reinforcement learning to replace redundant operations with more efficient ones.
result Transformed architectures outperform original and existing methods on CIFAR-10 and ImageNet datasets.
Proposes a method to improve neural architectures reproducibly.
problem Lack of reproducibility in Neural Architecture Transformer (NAT).
method Differentiable Neural Architecture Transformation (DNAT).
result DNAT outperforms NAT and is applicable to various models and datasets.
In the past few years, neural abstractive text summarization with sequence-to-sequence (seq2seq) models have gained a lot of popularity. Many interesting techniques have been proposed to improve seq2seq models, making them capable of handling different challenges, such as saliency, fluency and human readability, and ge…
New bounds show agnostic multiclass learning depends on two dimensions: Natarajan and Daniely-Shalev-Shwartz.
problem Understanding sample complexity in multiclass classification with agnostic learning.
method Developed a novel online procedure based on a self-adaptive multiplicative-weights algorithm.
result Agnostic sample complexity bounds are in the form of DS^(1.5)/ε + Nat/ε^2, nearly tight up to a √DS factor.
Learning latent variable models with stochastic variational inference is challenging when the approximate posterior is far from the true posterior, due to high variance in the gradient estimates. We propose a novel rejection sampling step that discards samples from the variational posterior which are assigned low likel…
A framework for cost of belief revision in uncertain agents.
problem Cost of revising beliefs in uncertain agents.
method Axiomatic framework for transport-based belief costs, postulates P0 and P1.
result Cost metric is conformally reweighted by Fisher information, leading to a cost floor diverging at certainty.
We show that within the class of left-invariant naturally reductive metrics MNat(G) on a compact simple Lie group G, every metric is spectrally isolated. We also observe that any collection of isospectral compact symmetric spaces is finite; this follows from a somewhat stronger statement…
The cost of belief changes with precision and is a hyperbolic geometry.
problem The cost of belief changes with precision and is a hyperbolic geometry.
method The cost of belief changes with precision and is a hyperbolic geometry.
result The cost of belief changes with precision and is a hyperbolic geometry.
New memory allocation scheme improves image generation performance.
problem Improving episodic and semantic memory representation in neural networks.
method Developed a hierarchical latent variable model with differentiable, locally block allocated latent memory.
result Improved conditional likelihood values on various datasets.
Proves torsion and curvature are unique for smooth manifolds.
problem Characterizing unique torsion-curvature pairs on smooth manifolds.
method Analyzes linear connections on smooth manifolds of dimension n≥4. result Torsion and curvature are the only pair satisfying Bianchi identities for linear connections.
Convolutional neural networks provide visual features that perform remarkably well in many computer vision applications. However, training these networks requires significant amounts of supervision. This paper introduces a generic framework to train deep networks, end-to-end, with no supervision. We propose to fix a se…
Deep generative models trained with large amounts of unlabelled data have proven to be powerful within the domain of unsupervised learning. Many real life data sets contain a small amount of labelled data points, that are typically disregarded when training generative models. We propose the Cluster-aware Generative Mod…
DSPPs improve predictive distributions in scalable regression tasks.
problem Improving predictive distributions in scalable regression tasks.
method Inspired by DGPs, DSPPs use mini-batch training and kernel basis functions for uncertainty control.
result DSPPs provide significantly better calibrated predictive distributions than other methods.
TRE improves density-ratio estimation for highly dissimilar densities.
problem Density-ratio estimation fails for significantly different densities.
method Telescoping density-ratio estimation (TRE) framework.
result TRE yields substantial improvements over existing methods for mutual information estimation.
Improved predictive uncertainties in Gaussian Process regression.
problem Substantially underestimated uncertainties in GP predictive distributions.
method Two methods for scalable GP regression: variational inference for FITC and direct posterior predictive distribution.
result Significantly better calibrated uncertainties and higher log likelihoods.
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.
Machine learning models are vulnerable to simple model stealing attacks if the adversary can obtain output labels for chosen inputs. To protect against these attacks, it has been proposed to limit the information provided to the adversary by omitting probability scores, significantly impacting the utility of the provid…
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.
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.