Neural machine translation used to convert CUDA to OpenCL.
problem Translating CUDA to OpenCL programs.
method Training input set generation, pre/post processing, case study.
result Improved accuracy in translating CUDA to OpenCL.
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,932 papers · 148 categories
Trend · papers per month
48 results for “program translation”
The task of translating between programming languages differs from the challenge of translating natural languages in that programming languages are designed with a far more rigid set of structural and grammatical rules. Previous work has used a tree-to-tree encoder/decoder model to take advantage of the inherent tree s…
SPoC uses search to translate pseudocode into correct programs with error localization.
problem Mapping pseudocode to functionally correct long programs.
method Search-based approach guided by compilation errors for credit assignment.
result Search improves synthesis success rate from 25.6% to 44.7%.
SPPL simplifies probabilistic programming for exact inference.
problem Efficient exact inference in probabilistic models.
method SPPL translates probabilistic programs into sum-product expressions, leveraging new techniques for scalability.
result SPPL achieves up to 3500x speedups in exact inference.
Automates API mapping across languages with minimal manual effort.
problem Manual effort required to identify parallel program corpora and API mappings.
method Combines domain adaptation and code embedding with GANs to align vector spaces of APIs.
result Automatically identifies cross-language API mappings with less prior knowledge.
Approximate dynamic programming is a popular method for solving large Markov decision processes. This paper describes a new class of approximate dynamic programming (ADP) methods- distributionally robust ADP-that address the curse of dimensionality by minimizing a pessimistic bound on the policy loss. This approach tur…
Program synthesis is the task of automatically generating a program consistent with a specification. Recent years have seen proposal of a number of neural approaches for program synthesis, many of which adopt a sequence generation paradigm similar to neural machine translation, in which sequence-to-sequence models are …
Paper proposes AXE loss for non-autoregressive machine translation, improving performance.
problem Challenges in training non-autoregressive models due to lack of autoregressive factors and cross entropy loss penalties.
method Proposes aligned cross entropy (AXE) loss function using a differentiable dynamic program for better word order alignment.
result AXE-based training improves performance on major WMT benchmarks and sets a new state of the art for non-autoregressive models.
Neural network identifies undeclared variables and infers their types.
problem Undeclared variable errors in programs.
method Trained on structural semantic details of AST, identifies and infers types of undeclared variables.
result Correctly identified and inferred types for 80% of programs with undeclared variable errors.
In this paper, we propose Neural Phrase-to-Phrase Machine Translation (NPMT). Our model uses a phrase attention mechanism to discover relevant input (source) segments that are used by a decoder to generate output (target) phrases. We also design an efficient dynamic programming algorithm to decode segments that all…
Heisenberg Translation Flowsmath.DS
Study of flows on circle bundles over translation surfaces, showing decay of correlations.
problem Ergodic properties of flows on circle bundles over translation surfaces.
method Generalizing Heisenberg nilflows to more general base surfaces, showing relatively mixing.
result Showed that such flows exhibit decay of correlations in the orthogonal complement of functions constant along fibers.
Automates translating natural language to Verilog for digital design.
problem Manual translation of natural language specifications to Verilog is time-consuming and error-prone.
method Fine-tuned GPT-2 to derive Verilog from English, using a dataset of design tasks.
result GPT-2 achieved 94.8% correct translation across simple and abstract design tasks.
Bootstrap bounds on Einstein manifolds using semidefinite programming.
problem Bounding geometric data of closed Einstein manifolds.
method Semidefinite programming applied to consistency conditions of geometric data.
result Bootstrap bounds translate to constraints on Kaluza-Klein modes.
Differentiable losses for combinatorial optimization problems in sequence modeling.
problem Mismatch between training and inference objectives in sequence models.
method Gradient descent over linear programs representing combinatorial optimization problems.
result Gradient descent can be applied to combinatorial optimization problems efficiently.
West Frisian lemmatizer, POS tagger, and parser created.
problem Creating accurate lemmatization, POS tagging, and dependency parsing for West Frisian.
method Using a corpus of 44,714 words annotated according to Universal Dependency version 2. Applying Dutch POS tags and morphological/syntactic annotations to create Frisian translations.
result Significant improvement in lemma accuracy compared to default parameters.
Stan is a probabilistic programming language that has been increasingly used for real-world scalable projects. However, to make practical inference possible, the language sacrifices some of its usability by adopting a block syntax, which lacks compositionality and flexible user-defined functions. Moreover, the semantic…
Dynamic programming (DP) solves a variety of structured combinatorial problems by iteratively breaking them down into smaller subproblems. In spite of their versatility, DP algorithms are usually non-differentiable, which hampers their use as a layer in neural networks trained by backpropagation. To address this issue,…
Felix Klein's so-called Erlangen Program was published in 1872 as professoral dissertation. It proposed a new solution to the problem how to classify and characterize geometries on the basis of projective geometry and group theory. The given translation was made in 1892 by Dr. M. W. Haskell and transcribed by N. C. Rug…
This tutorial introduces a new and powerful set of techniques variously called "neural machine translation" or "neural sequence-to-sequence models". These techniques have been used in a number of tasks regarding the handling of human language, and can be a powerful tool in the toolbox of anyone who wants to model seque…
The ability to generate natural language sequences from source code snippets has a variety of applications such as code summarization, documentation, and retrieval. Sequence-to-sequence (seq2seq) models, adopted from neural machine translation (NMT), have achieved state-of-the-art performance on these tasks by treating…
Geometric approach improves motion alignment accuracy and efficiency.
problem Temporal alignment of human motion data for various applications.
method Geometric point of view, principal fiber bundle, reparameterization invariant projection, dynamic programming, keyframe correspondences.
result Temporal alignment procedures are more accurate and computationally efficient.
Deep learning has seen tremendous success over the past decade in computer vision, machine translation, and gameplay. This success rests in crucial ways on gradient-descent optimization and the ability to learn parameters of a neural network by backpropagating observed errors. However, neural network architectures are …
GShard enables scaling of large neural networks with automatic sharding and lightweight APIs.
problem Scaling neural networks to handle vast training data and compute efficiently.
method GShard uses lightweight annotation APIs and XLA compiler extensions for parallel computation.
result GShard successfully trained a 600 billion parameter model on 2048 TPUs in 4 days.
Paper uses NMT to predict solutions to stochastic optimization problems quickly.
problem Predicting solutions to stochastic discrete optimization problems under uncertainty.
method Applied a state-of-the-art NMT algorithm with minimal adaptations and hyperparameter tuning.
result NMT can produce accurate solutions in milliseconds with less variability.
We describe Bayesian Layers, a module designed for fast experimentation with neural network uncertainty. It extends neural network libraries with drop-in replacements for common layers. This enables composition via a unified abstraction over deterministic and stochastic functions and allows for scalability via the unde…
Survey of Machine Learning Testing: Properties, Components, and Trends.
problem Challenges in testing machine learning models.
method Comprehensive review of 144 ML testing papers.
result Identification of research challenges and directions.
Develops consistent approximations for composite optimization problems.
problem Significant errors in solutions due to approximations in optimization problems.
method Specifies conditions for well-behaved approximations in minimizers, stationary points, and level-sets for a broad class of composite problems.
result Framework of consistent approximations for composite problems, including stochastic, neural-network, and multi-objective optimization.
Deep neural networks have achieved impressive supervised classification performance in many tasks including image recognition, speech recognition, and sequence to sequence learning. However, this success has not been translated to applications like question answering that may involve complex arithmetic and logic reason…
Convex Optimization in Juliamath.OC
This paper describes Convex, a convex optimization modeling framework in Julia. Convex translates problems from a user-friendly functional language into an abstract syntax tree describing the problem. This concise representation of the global structure of the problem allows Convex to infer whether the problem complies …
Batch-splitting (data-parallelism) is the dominant distributed Deep Neural Network (DNN) training strategy, due to its universal applicability and its amenability to Single-Program-Multiple-Data (SPMD) programming. However, batch-splitting suffers from problems including the inability to train very large models (due to…
Now that machine learning algorithms lie at the center of many resource allocation pipelines, computer scientists have been unwittingly cast as partial social planners. Given this state of affairs, important questions follow. What is the relationship between fairness as defined by computer scientists and notions of soc…
A deep-learning inference accelerator is synthesized from a C-language software program parallelized with Pthreads. The software implementation uses the well-known producer/consumer model with parallel threads interconnected by FIFO queues. The LegUp high-level synthesis (HLS) tool synthesizes threads into parallel FPG…
Unified approach to path planning using probabilistic inference on factor graphs.
problem Path planning problems using probabilistic inference.
method Unified framework using probabilistic factor graphs and message composition rules.
result Unified approach includes various algorithms like Sum-product, Max-product, Dynamic programming, and mixed criteria.
Probabilistic models often have parameters that can be translated, scaled, permuted, or otherwise transformed without changing the model. These symmetries can lead to strong correlation and multimodality in the posterior distribution over the model's parameters, which can pose challenges both for performing inference a…
The paper decomposes spectral functions on marked tori strata.
problem Decomposing square-integrable functions on strata of differentials.
method Spectral decomposition and analysis of differential operators.
result The continuous spectrum of the foliated Laplacian is larger than Siegel-Veech transforms.
Classifies ancient noncollapsed flows in 4D space.
problem Classify all noncollapsed singularities of the mean curvature flow in R^4.
method Proves differential neck theorem, introduces new ideas like switch and differential Merle-Zaag dynamics.
result Classifies all ancient noncollapsed solutions in R^4.
A new framework for generative modeling using value-driven transport.
problem Developing efficient methods for generative modeling.
method A discrete-time stochastic control formulation of measure transport, formulated as a linear program with dual variables corresponding to the optimal value function.
result Well-trained VDT policies lead to straight transport paths that can be simulated quickly and robustly.
Limited Resource Allocation in a Non-Markovian World: The Case of Maternal and Child Healthcarecs.AI
New approach tackles non-Markovian behavior in maternal health programs.
problem Improving adherence and engagement in maternal and child healthcare programs.
method Extending RMABs to non-Markovian settings, using time-series forecasting and TARI policy.
result Significant increase in engagement and content listened compared to existing methods.
Self-guided ALPs improve MDP policies without domain knowledge.
problem Improving MDP policies with minimal domain knowledge.
method Self-guided sequence of ALPs with random basis functions and state-relevance distribution.
result High probability error bounds and improved policy performance.
We aim to reduce the burden of programming and deploying autonomous systems to work in concert with people in time-critical domains, such as military field operations and disaster response. Deployment plans for these operations are frequently negotiated on-the-fly by teams of human planners. A human operator then trans…
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.
Overcoming the Curse of Sentence Length for Neural Machine Translation using Automatic Segmentationcs.CL
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.
Rigidity results for mean curvature flow graphical translators moving in non-graphical directionmath.DG
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.
Unified framework for fast large-scale portfolio optimization.
problem Efficient portfolio optimization for large-scale financial data.
method Incorporates shrinkage and regularization techniques, addressing multiple objectives.
result AP-Trees and PCA-based factor models consistently outperform other approaches in out-of-sample portfolio performance.
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.