Search Results for author:
Found 9 papers, 3 papers with code
Conditional Enzyme Generation Using Protein Language Models with Adapters
Impressively, it can also generate within the joint distribution of enzymatic function and taxonomy, and it can generalize to rare and unseen enzyme families and taxonomies.
Towards Joint Sequence-Structure Generation of Nucleic Acid and Protein Complexes with SE(3)-Discrete Diffusion
In this work, we introduce MMDiff, a generative model that jointly designs sequences and structures of nucleic acid and protein complexes, independently or in complex, using joint SE(3)-discrete diffusion noise.
Improved Online Conformal Prediction via Strongly Adaptive Online Learning
We prove that our methods achieve near-optimal strongly adaptive regret for all interval lengths simultaneously, and approximately valid coverage.
Momentum Contrastive Autoencoder: Using Contrastive Learning for Latent Space Distribution Matching in WAE
Wasserstein autoencoder (WAE) shows that matching two distributions is equivalent to minimizing a simple autoencoder (AE) loss under the constraint that the latent space of this AE matches a pre-specified prior distribution.
Merlion: A Machine Learning Library for Time Series
We introduce Merlion, an open-source machine learning library for time series.
Local Calibration: Metrics and Recalibration
In this work, we propose the local calibration error (LCE) to span the gap between average and individual reliability.
Momentum Contrastive Autoencoder
Quantitatively, we show that our algorithm achieves a new state-of-the-art FID of 54. 36 on CIFAR-10, and performs competitively with existing models on CelebA in terms of FID score.
An investigation of phone-based subword units for end-to-end speech recognition
For Switchboard, our phone-based BPE system achieves 6. 8\%/14. 4\% word error rate (WER) on the Switchboard/CallHome portion of the test set while joint decoding achieves 6. 3\%/13. 3\% WER.
Learning to Search via Retrospective Imitation
We study the problem of learning a good search policy for combinatorial search spaces.
