Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Adam R. Klivans"'
Autor:
Daniel J. Diaz, Chengyue Gong, Jeffrey Ouyang-Zhang, James M. Loy, Jordan Wells, David Yang, Andrew D. Ellington, Alexandros G. Dimakis, Adam R. Klivans
Publikováno v:
Nature Communications, Vol 15, Iss 1, Pp 1-15 (2024)
Abstract Engineering stabilized proteins is a fundamental challenge in the development of industrial and pharmaceutical biotechnologies. We present Stability Oracle: a structure-based graph-transformer framework that achieves SOTA performance on accu
Externí odkaz:
https://doaj.org/article/09e8ba873c164e1eb910e28fd655392f
Autor:
Daniel J. Diaz, Chengyue Gong, Jeffrey Ouyang-Zhang, James M. Loy, Jordan Wells, David Yang, Andrew D. Ellington, Alex Dimakis, Adam R. Klivans
Stabilizing proteins is a fundamental challenge in protein engineering and is almost always a prerequisite for the development of industrial and pharmaceutical biotechnologies. Here we present Stability Oracle: a structure-based graph-transformer fra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e0c67e32a0c27baf221dc7362b72e04
https://doi.org/10.1101/2023.05.15.540857
https://doi.org/10.1101/2023.05.15.540857
Autor:
Jay Reddy, Doug Wallace, Chuck Ferry, Cristian Filip, James Mobley, Swagato Chakraborty, Varun Gorti, David Z. Pan, Adam R. Klivans, James Pingenot, Daniel de Araujo
Publikováno v:
2021 IEEE 30th Conference on Electrical Performance of Electronic Packaging and Systems (EPEPS).
Autor:
Jay Reddy, Jun Fan, Arun Chada, James L. Drewniak, Adam R. Klivans, Zurab Kiguradze, Jiayi He, Bhyrav M. Mutnury
Publikováno v:
2019 IEEE International Symposium on Electromagnetic Compatibility, Signal & Power Integrity (EMC+SIPI).
This paper introduces an integer programming application for PCB stack-up arrangement. The general rules in stack-up arrangement are transformed to equalities and inequalities using mathematical programming techniques. Then the integer programming so
Autor:
Raghu Meka, Adam R. Klivans
Publikováno v:
FOCS
We give a simple, multiplicative-weight update algorithm for learning undirected graphical models or Markov random fields (MRFs). The approach is new, and for the well-studied case of Ising models or Boltzmann machines we obtain an algorithm that use
Publikováno v:
Theory of Computing. 10:1-26
We give the first nontrivial upper bounds on the average sensitivity and noise sensitivity of polynomial threshold functions. More specifically, for a Boolean function f on n variables equal to the sign of a real, multivariate polynomial of total deg
Autor:
Adam R. Klivans, Alexander A. Sherstov
Publikováno v:
computational complexity. 19:581-604
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that there exist functions $$\phi_{1}, \ldots , \phi_{r}$$: {− 1, 1}n →
Autor:
Adam R. Klivans, Lance Fortnow
Publikováno v:
Journal of Computer and System Sciences. 75:27-36
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circuit class C in Angluin's model of exact learning from membership and equi
Autor:
Rocco A. Servedio, Adam R. Klivans
Publikováno v:
Journal of Computer and System Sciences. 74:35-48
We give a new algorithm for learning intersections of halfspaces with a margin, i.e. under the assumption that no example lies too close to any separating hyperplane. Our algorithm combines random projection techniques for dimensionality reduction, p
Publikováno v:
Journal of Computer and System Sciences. 74:16-34
We consider the complexity of properly learning concept classes, i.e. when the learner must output a hypothesis of the same form as the unknown concept. We present the following new upper and lower bounds on well-known concept classes:•We show that