Language models for low-resource languages still make frequent grammatical errors. Alignment methods such as RLHF and DPO can correct them. However, they require human judgements, which are scarce for languages such as Icelandic. Automatic rewards offer an alternative, yet models can learn to exploit them without improving (reward hacking). We present SAGA (Score-weighted Adaptive Generation Alignment), which builds preference pairs using dependency parsers. Such parsers already exist for many low-resource languages. SAGA's reward combines parse quality with lexical diversity. It keeps only pairs whose reward gap reaches a threshold and trains on them with DPO. On Danish, Icelandic and Norwegian Bokm{\aa}l, SAGA raises reward-parser success by 18 to 28 points. It improves all four model families we test, although one Icelandic run is flagged for reward hacking. An independent parser confirms the gains, and native speakers prefer SAGA outputs in Danish (69%) and Icelandic (80%). Online RL methods exploit the Icelandic reward. On the same base model, SAGA scores higher on both parsers. Existing linguistic resources, combined with safeguards against reward hacking, can therefore stand in for human judgements. This makes grammatical alignment possible for the many languages that have parsers but no such data.
This paper investigates developing real-world perception for active agents, proposes Gibson Environment for this purpose, and showcases a set of perceptual tasks learned therein.
F. Xia, Amir Zamir, Zhi-Yang He et al.· 2018 IEEE/CVF Conference on...· 1,069 citations· ⚡112
The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.
Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al.· Information and Software Tec...· 394 citations· ⚡54
The possibility of inferring high-dimensional data inference in a model that consists of a prior and an auxiliary differentiable constraint given some additional information is considered, thereby allowing a range of potential applications in adapting models to new domains and tasks.
Alexandros Graikos, Esmeralda S. Whitammer, N. Jojic et al.· Neural Information Processin...· 316 citations· ⚡15
It is proved that any global minimizer of the trajectory balance objective can define a policy that samples exactly from the target distribution, and empirically demonstrate the benefits of the trajectories balance objective for GFlowNet convergence, diversity of generated samples, and robustness to long action sequenc...
Esmeralda S. Whitammer, Moksh Jain, Emmanuel Bengio et al.· Neural Information Processin...· 302 citations· ⚡60
An algorithm is proposed which leverages disentangled semantic factors to generate adversarial perturbation by altering controlled semantic attributes to fool the learner towards various "adversarial" targets.
Haonan Qiu, Chaowei Xiao, Lei Yang et al.· arXiv.org· 208 citations· ⚡17
This work proposes a HALO that directly maximizes the utility of generations instead of maximizing the log-likelihood of preferences, and suggests that the best loss depends on the inductive biases most appropriate for a given setting, an oft-overlooked consideration.
A machine-learning approach called CheMeleon provides a practical way to develop new drugs or other molecules with much less detailed, expensive experimentation.
Research Manager Mike Walker reflects on a career spanning hacker culture, cybersecurity, and AI, sharing lessons about trust, teamwork, leadership, and why solving difficult problems requires curiosity, judgment, agility—and an understanding of the rules. The post Learn the rules: The hacker mindset appeared first on Microsoft Research.
Learn how Google Antigravity and our Cheminformatics Skills accelerate drug discovery workflows, search compounds, and propose novel rigidified macrocycles.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.