Arrow Research search

Author name cluster

Thomas Miller

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
1 author row

Possible papers

2

NeurIPS Conference 2025 Conference Paper

NeuralPLexer3: Accurate Biomolecular Complex Structure Prediction with Flow Models

  • Jarren Zhuoran Qiao
  • Feizhi Ding
  • Thomas Dresselhaus
  • Mia Rosenfeld
  • Xiaotian Han
  • Owen Howell
  • Aniketh Iyengar
  • Stephen Opalenski

Biomolecular structure determination is essential to a mechanistic understanding of diseases and the development of novel therapeutics. Machine-learning-based structure prediction methods have made significant advancements by computationally predicting protein and bioassembly structures from sequences and molecular topology alone. Despite substantial progress in the field, challenges remain to deliver structure prediction models to real-world drug discovery. Here, we present NeuralPLexer3 -- a physics-inspired flow-based generative model that achieves state-of-the-art prediction accuracy on key biomolecular interaction types and improves training and sampling efficiency compared to its predecessors and alternative methodologies. Examined through existing and new benchmarks, NeuralPLexer3 excels in areas crucial to structure-based drug design, including blind docking, physical validity, and ligand-induced protein conformational changes.

NeurIPS Conference 1988 Conference Paper

Optimization by Mean Field Annealing

  • Griff Bilbro
  • Reinhold Mann
  • Thomas Miller
  • Wesley Snyder
  • David Van den Bout
  • Mark White

Nearly optimal solutions to many combinatorial problems can be found using stochastic simulated annealing. This paper extends the concept of simulated annealing from its original formulation as a Markov process to a new formulation based on mean field theory. Mean field annealing essentially replaces the discrete de(cid: 173) grees of freedom in simulated annealing with their average values as computed by the mean field approximation. The net result is that equilibrium at a given temperature is achieved 1-2 orders of magnitude faster than with simulated annealing. A general frame(cid: 173) work for the mean field annealing algorithm is derived, and its re(cid: 173) lationship to Hopfield networks is shown. The behavior of MFA is examined both analytically and experimentally for a generic combi(cid: 173) natorial optimization problem: graph bipartitioning. This analysis indicates the presence of critical temperatures which could be im(cid: 173) portant in improving the performance of neural networks. STOCHASTIC VERSUS MEAN FIELD In combinatorial optimization problems, an objective function or Hamiltonian, H(s), is presented which depends on a vector of interacting 3pim, S = {81, ". ,8N}, in some complex nonlinear way. Stochastic simulated annealing (SSA) (S. Kirk(cid: 173) patrick, C. Gelatt, and M. Vecchi (1983)) finds a global minimum of H by com(cid: 173) bining gradient descent with a random process. This combination allows, under certain conditions, choices of s which actually increa3e H, thus providing SSA with a mechanism for escaping from local minima. The frequency and severity of these uphill moves is reduced by slowly decreasing a parameter T (often referred to as the temperature) such that the system settles into a global optimum. Two conceptual operationo; are involved in simulated annealing: a thermodatic op(cid: 173) eration which schedules decreases in the temperature, and a relazation operation 92

v2026.09.13