Zobrazeno 1 - 10
of 1 861
pro vyhledávání: '"Huang, Michael"'
Autor:
Liu, Renjie, Zhang, Yanxiang, Zhu, Yun, Sun, Haicheng, Zhang, Yuanbo, Huang, Michael Xuelin, Cai, Shanqing, Meng, Lei, Zhai, Shumin
The impressive capabilities in Large Language Models (LLMs) provide a powerful approach to reimagine users' typing experience. This paper demonstrates Proofread, a novel Gboard feature powered by a server-side LLM in Gboard, enabling seamless sentenc
Externí odkaz:
http://arxiv.org/abs/2406.04523
Multimodal search has become increasingly important in providing users with a natural and effective way to ex-press their search intentions. Images offer fine-grained details of the desired products, while text allows for easily incorporating search
Externí odkaz:
http://arxiv.org/abs/2404.15790
Autor:
Huang, Michael, Gupta, Vishal
We propose a novel family of decision-aware surrogate losses, called Perturbation Gradient (PG) losses, for the predict-then-optimize framework. These losses directly approximate the downstream decision loss and can be optimized using off-the-shelf g
Externí odkaz:
http://arxiv.org/abs/2402.03256
Autor:
Lin, Susan, Warner, Jeremy, Zamfirescu-Pereira, J. D., Lee, Matthew G., Jain, Sauhard, Huang, Michael Xuelin, Lertvittayakumjorn, Piyawat, Cai, Shanqing, Zhai, Shumin, Hartmann, Björn, Liu, Can
Dictation enables efficient text input on mobile devices. However, writing with speech can produce disfluent, wordy, and incoherent text and thus requires heavy post-processing. This paper presents Rambler, an LLM-powered graphical user interface tha
Externí odkaz:
http://arxiv.org/abs/2401.10838
Autor:
Vengalam, Uday Kumar Reddy, Hahn, Andrew, Liu, Yongchao, Sharma, Anshujit, Wu, Hui, Huang, Michael
Due to 5G deployment, there is significant interest in LDPC decoding. While much research is devoted on efficient hardwiring of algorithms based on Belief Propagation (BP), it has been shown that LDPC decoding can be formulated as a combinatorial opt
Externí odkaz:
http://arxiv.org/abs/2312.02161
In this paper we verify that with the exception of the $(2, 2n+1)$ torus knots, positive 2-bridge knots up to 31 crossings do not admit chirally cosmetic surgeries. A knot $K$ admits chirally cosmetic surgeries if there exist surgeries $S^3_r$ and $S
Externí odkaz:
http://arxiv.org/abs/2308.10126
With the slowdown of improvement in conventional von Neumann systems, increasing attention is paid to novel paradigms such as Ising machines. They have very different approach to NP-complete optimization problems. Ising machines have shown great pote
Externí odkaz:
http://arxiv.org/abs/2305.01623
Nature apparently does a lot of computation constantly. If we can harness some of that computation at an appropriate level, we can potentially perform certain type of computation (much) faster and more efficiently than we can do with a von Neumann co
Externí odkaz:
http://arxiv.org/abs/2304.02525