SearcharxivSearch

arXiv subjects

Michael Bailey

Publications and source records attributed to Michael Bailey.

At least 19 recordsLinked to original sources

Solvaformer: an SE(3)-equivariant graph transformer for small molecule solubility prediction

Accurate prediction of small molecule solubility using material-sparing approaches is critical for accelerating synthesis and process optimization, yet experimental measurement is costly and many learning approaches either depend on quantumderived descriptors or offer limited interpretability. We introduce Solvaformer, a geometry-aware graph transformer that models solutions as multiple molecules with independent SE(3) symmetries. The architecture combines intramolecular SE(3)-equivariant attention with intermolecular scalar attention, enabling cross-molecular communication without imposing spurious relative geometry. We train Solvaformer in a multi-task setting to predict both solubility (log S) and solvation free energy, using an alternating-batch regimen that trains on quantum-mechanical data (CombiSolv-QM) and on experimental measurements (BigSolDB 2.0). Solvaformer attains the strongest overall performance among the learned models and approaches a DFT-assisted gradient-boosting baseline, while outperforming an EquiformerV2 ablation and sequence-based alternatives. In addition, token-level attention produces chemically coherent attributions: case studies recover known intra- vs. inter-molecular hydrogen-bonding patterns that govern solubility differences in positional isomers. Taken together, Solvaformer provides an accurate, scalable, and interpretable approach to solution-phase property prediction by uniting geometric inductive bias with a mixed dataset training strategy on complementary computational and experimental data.

physics.chem-ph

Using Machine Learning in Analyzing Air Quality Discrepancies of Environmental Impact

In this study, we apply machine learning and software engineering in analyzing air pollution levels in City of Baltimore. The data model was fed with three primary data sources: 1) a biased method of estimating insurance risk used by homeowners loan corporation, 2) demographics of Baltimore residents, and 3) census data estimate of NO2 and PM2.5 concentrations. The dataset covers 650,643 Baltimore residents in 44.7 million residents in 202 major cities in US. The results show that air pollution levels have a clear association with the biased insurance estimating method. Great disparities present in NO2 level between more desirable and low income blocks. Similar disparities exist in air pollution level between residents' ethnicity. As Baltimore population consists of a greater proportion of people of color, the finding reveals how decades old policies has continued to discriminate and affect quality of life of Baltimore citizens today.

cs.CY

Many-Shot In-Context Learning for Molecular Inverse Design

Large Language Models (LLMs) have demonstrated great performance in few-shot In-Context Learning (ICL) for a variety of generative and discriminative chemical design tasks. The newly expanded context windows of LLMs can further improve ICL capabilities for molecular inverse design and lead optimization. To take full advantage of these capabilities we developed a new semi-supervised learning method that overcomes the lack of experimental data available for many-shot ICL. Our approach involves iterative inclusion of LLM generated molecules with high predicted performance, along with experimental data. We further integrated our method in a multi-modal LLM which allows for the interactive modification of generated molecular structures using text instructions. As we show, the new method greatly improves upon existing ICL methods for molecular design while being accessible and easy to use for scientists.

cs.CL

Social Networks and Spatial Mobility: Evidence from Facebook in India

This paper studies the role of social networks in spatial mobility across India. Using aggregated and de-identified data from the world's largest online social network, we (i) document new descriptive findings on the structure of social networks and spatial mobility in India; (ii) quantify the effects of social networks on annual migration choice; and (iii) embed these estimates in a spatial equilibrium model to study the wage implications of increasing social connectedness. Across millions of individuals, we find that multiple measures of social capital are concentrated among the rich and educated and among migrants. Across destinations, both mobility patterns and social networks are concentrated toward richer areas. A model of migration suggests individuals are indifferent between a 10% increase in destination wages and a 12-16% increase in destination social networks. Accounting for networks reduces the migration-distance relationship by 19%. In equilibrium, equalizing social networks across locations improves average wages by 3% (24% for the bottom wage-quartile), a larger impact than removing the marginal cost of distance. We find evidence of an economic support mechanism, with destination economic improvements reducing the migration-network elasticity. We also find suggestive evidence for an emotional support mechanism from qualitative surveys among Facebook users. Difference-in-difference estimates suggest college attendance delivers a 20% increase in network size and diversity. Taken together, our data suggest that - by reducing effective moving costs - increasing social connectedness across space may have considerable economic gains.

econ.GN

Designing Toxic Content Classification for a Diversity of Perspectives

In this work, we demonstrate how existing classifiers for identifying toxic comments online fail to generalize to the diverse concerns of Internet users. We survey 17,280 participants to understand how user expectations for what constitutes toxic content differ across demographics, beliefs, and personal experiences. We find that groups historically at-risk of harassment - such as people who identify as LGBTQ+ or young adults - are more likely to to flag a random comment drawn from Reddit, Twitter, or 4chan as toxic, as are people who have personally experienced harassment in the past. Based on our findings, we show how current one-size-fits-all toxicity classification algorithms, like the Perspective API from Jigsaw, can improve in accuracy by 86% on average through personalized model tuning. Ultimately, we highlight current pitfalls and new design directions that can improve the equity and efficacy of toxic content classifiers for all users.

cs.SI

A lower bound on HMOLS with equal sized holes

It is known that $N(n)$, the maximum number of mutually orthogonal latin squares of order $n$, satisfies the lower bound $N(n) \ge n^{1/14.8}$ for large $n$. For $h\ge 2$, relatively little is known about the quantity $N(h^n)$, which denotes the maximum number of `HMOLS' or mutually orthogonal latin squares having a common equipartition into $n$ holes of a fixed size $h$. We generalize a difference matrix method that had been used previously for explicit constructions of HMOLS. An estimate of R.M. Wilson on higher cyclotomic numbers guarantees our construction succeeds in suitably large finite fields. Feeding this into a generalized product construction, we are able to establish the lower bound $N(h^n) \ge (\log n)^{1/\delta}$ for any $\delta>2$ and all $n > n_0(h,\delta)$.

math.CO

Online Appendix & Additional Results for The Determinants of Social Connectedness in Europe

In this online appendix we provide additional information and analyses to support "The Determinants of Social Connectedness in Europe." We include a number of case studies illustrating how language, history, and other factors have shaped European social networks. We also look at the effects of social connectedness. Our results provide empirical support for theoretical models that suggest social networks play an important role in individuals' travel decisions. We study variation in the degree of connectedness of regions to other European countries, finding a negative correlation between Euroscepticism and greater levels of international connection.

econ.GN

A neighbourhood theorem for submanifolds in generalized complex geometry

We study neighbourhoods of submanifolds in generalized complex geometry. Our first main result provides sufficient criteria for such a submanifold to admit a neighbourhood on which the generalized complex structure is B-field equivalent to a holomorphic Poisson structure. This is intimately tied with our second main result, which is a rigidity theorem for generalized complex deformations of holomorphic Poisson structures. Specifically, on a compact manifold with boundary we provide explicit conditions under which any generalized complex perturbation of a holomorphic Poisson structure is B-field equivalent to another holomorphic Poisson structure. The proofs of these results require two analytical tools: Hodge decompositions on almost complex manifolds with boundary, and the Nash-Moser algorithm. As a concrete application of these results, we show that on a four-dimensional generalized complex submanifold which is generically symplectic, a neighbourhood of the entire complex locus is B-field equivalent to a holomorphic Poisson structure. Furthermore, we use the neighbourhood theorem to develop the theory of blowing down submanifolds in generalized complex geometry.

math.DG

The local structure of generalized complex branes

We show (modulo a parity condition) that, a generalized complex brane in a generalized complex manifold is locally equivalent to a holomorphic coisotropic submanifold of a holomorphic Poisson structure, with higher-rank branes corresponding to holomorphic Poisson modules. We describe (but do not prove here) the global version of this holomorphicity result. Finally, we use the "local holomorphic gauges" to give examples, in the Hopf surface with nonstandard generalized complex structure, of branes which are neither Lagrangian nor complex.

math.SG

Fine-Grained Endpoint-Driven In-Network Traffic Control for Proactive DDoS Attack Mitigation

Volumetric attacks, which overwhelm the bandwidth of a destination, are among the most common DDoS attacks today. Despite considerable effort made by both research and industry, our recent interviews with over 100 potential DDoS victims in over 10 industry segments indicate that today's DDoS prevention is far from perfect. On one hand, few academical proposals have ever been deployed in the Internet; on the other hand, solutions offered by existing DDoS prevention vendors are not a silver bullet to defend against the entire attack spectrum. Guided by such large-scale study of today's DDoS defense, in this paper, we present MiddlePolice, the first readily deployable and proactive DDoS prevention mechanism. We carefully architect MiddlePolice such that it requires no changes from both the Internet core and the network stack of clients, yielding instant deployability in the current Internet architecture. Further, relying on our novel capability feedback mechanism, MiddlePolice is able to enforce destination-driven traffic control so that it guarantees to deliver victim-desired traffic regardless of the attacker strategies. We implement a prototype of MiddlePolice, and demonstrate its feasibility via extensive evaluations in the Internet, hardware testbed and large-scale simulations.

cs.NI

Type one generalized Calabi--Yaus

We study type one generalized complex and generalized Calabi--Yau manifolds. We introduce a cohomology class that obstructs the existence of a globally defined, closed 2-form which agrees with the symplectic form on the leaves of the generalized complex structure, the twisting class. We prove that in a compact, type one, 4n-dimensional generalized complex manifold the Euler characteristic must be even and equal to the signature modulo four. The generalized Calabi--Yau condition places much stronger constrains: a compact type one generalized Calabi--Yau fibers over the 2-torus and if the structure has one compact leaf, then this fibration can be chosen to be the fibration by the symplectic leaves of the generalized complex structure. If the twisting class vanishes, one can always deform the structure so that it has a compact leaf. Finally we prove that every symplectic fibration over the 2-torus admits a type one generalized Calabi--Yau structure.

math.DG

Integration of generalized complex structures

We solve the integration problem for generalized complex manifolds, obtaining as the natural integrating object a weakly holomorphic symplectic groupoid, which is a real symplectic groupoid with a compatible complex structure defined only on the associated stack, i.e., only up to Morita equivalence. We explain how such objects differentiate to give generalized complex manifolds, and we show that a generalized complex manifold is integrable in this sense if and only if its underlying real Poisson structure is integrable. Crucial to our solution are several new technical tools which are of independent interest, namely, a reduction procedure for Lie groupoid actions on Courant algebroids, as well as certain local-to-global extension results for multiplicative forms on local Lie groupoids. Finally, we implement our generalized complex integration procedure in several concrete examples.

math.SG

Blow-ups in generalized complex geometry

We study blow-ups in generalized complex geometry. To that end we introduce the concept of holomorphic ideal, which allows one to define a blow-up in the category of smooth manifolds. We then investigate which generalized complex submanifolds are suitable for blowing up. Two classes naturally appear; generalized Poisson submanifolds and generalized Poisson transversals, submanifolds which look complex, respectively symplectic in transverse directions. We show that generalized Poisson submanifolds carry a canonical holomorphic ideal and give a necessary and sufficient condition for the corresponding blow-up to be generalized complex. For the generalized Poisson transversals we give a normal form for a neighborhood of the submanifold, and use that to define a generalized complex blow-up, which is up to deformation independent of choices.

math.DG

A New Approach to DDoS Defense using SDN and NFV

Networks today rely on expensive and proprietary hard- ware appliances, which are deployed at fixed locations, for DDoS defense. This introduces key limitations with respect to flexibility (e.g., complex routing to get traffic to these "chokepoints") and elasticity in handling changing attack patterns. We observe an opportunity to ad- dress these limitations using new networking paradigms such as software-defined networking (SDN) and network functions virtualization (NFV). Based on this observation, we design and implement of Bohatei, an elastic and flexible DDoS defense system. In designing Bohatei, we address key challenges of scalability, responsive- ness, and adversary-resilience. We have implemented defenses for several well-known DDoS attacks in Bohatei. Our evaluations show that Bohatei is scalable (handling 500 Gbps attacks), responsive (mitigating attacks within one minute), and resilient to dynamic adversaries.

cs.NI

Local analytic geometry of generalized complex structures

A generalized complex manifold is locally gauge-equivalent to the product of a holomorphic Poisson manifold with a real symplectic manifold, but in possibly many different ways. In this paper we show that the isomorphism class of the holomorphic Poisson structure occurring in this local model is independent of the choice of gauge equivalence, and is hence the unique local invariant of generalized complex manifolds. We use this result to prove that the complex locus of a generalized complex manifold naturally inherits the structure of a complex analytic space.

math.SG

Local classification of generalized complex structures

We give a local classification of generalized complex structures. About a point, a generalized complex structure is equivalent to a product of a symplectic manifold with a holomorphic Poisson manifold. We use a Nash-Moser type argument in the style of Conn's linearization theorem.

math.DG

Symplectic foliations and generalized complex structures

We answer the natural question: when are a regular Poisson structure along with a complex structure transverse to its symplectic leaves induced by generalized complex structure? The leafwise symplectic form and transverse complex structure determine an obstruction class in a certain cohomology, which vanishes if and only if our question has an affirmative answer. We first study a component of this obstruction, which gives the condition that the leafwise cohomology class of the symplectic form must be transversely pluriharmonic. As a consequence, under certain topological hypotheses, we infer that we actually have a symplectic fibre bundle over a complex base. We then show how to compute the full obstruction via a spectral sequence. We give various concrete necessary and sufficient conditions for the vanishing of the obstruction. Throughout, we give examples to test the sharpness of these conditions, including a symplectic fibre bundle over a complex base which does not come from a generalized complex structure, and a regular generalized complex structure which is very unlike a symplectic fibre bundle, i.e., for which nearby leaves are not symplectomorphic.

math.SG