Searcharxiv⌕ Search

arXiv subjects

Andrew Wang

Publications and source records attributed to Andrew Wang.

At least 55 records · Page 3Linked to original sources

Learning to Generate Text in Arbitrary Writing Styles

Prior work in style-controlled text generation has focused on tasks such as emulating the style of prolific literary authors, producing formal or informal text, and mitigating toxicity of generated text. Plentiful demonstrations of these styles are available, and as a result modern language models are often able to emulate them, either via prompting or discriminative control. However, in applications such as writing assistants, it is desirable for language models to produce text in an author-specific style on the basis of a potentially small writing sample. For example, someone writing in a particular dialect may prefer writing suggestions that retain the same dialect. We find that instruction-tuned language models can struggle to reproduce author-specific style demonstrated in a prompt. Instead, we propose to guide a language model to generate text in a target style using contrastively-trained representations that capture stylometric features. Our approach (StyleMC) combines an author-adapted language model with sequence-level inference to improve stylistic consistency, and is found to be effective in a variety of conditions, including unconditional generation and style transfer. Additionally, we find that the proposed approach can serve as an effective anonymization method, by editing a document to mask authorship while preserving the original meaning

cs.CL↗

Representation Learning for Frequent Subgraph Mining

Identifying frequent subgraphs, also called network motifs, is crucial in analyzing and predicting properties of real-world networks. However, finding large commonly-occurring motifs remains a challenging problem not only due to its NP-hard subroutine of subgraph counting, but also the exponential growth of the number of possible subgraphs patterns. Here we present Subgraph Pattern Miner (SPMiner), a novel neural approach for approximately finding frequent subgraphs in a large target graph. SPMiner combines graph neural networks, order embedding space, and an efficient search strategy to identify network subgraph patterns that appear most frequently in the target graph. SPMiner first decomposes the target graph into many overlapping subgraphs and then encodes each subgraph into an order embedding space. SPMiner then uses a monotonic walk in the order embedding space to identify frequent motifs. Compared to existing approaches and possible neural alternatives, SPMiner is more accurate, faster, and more scalable. For 5- and 6-node motifs, we show that SPMiner can almost perfectly identify the most frequent motifs while being 100x faster than exact enumeration methods. In addition, SPMiner can also reliably identify frequent 10-node motifs, which is well beyond the size limit of exact enumeration approaches. And last, we show that SPMiner can find large up to 20 node motifs with 10-100x higher frequency than those found by current approximate methods.

cs.LG↗

Lithium-ion battery performance model including solvent segregation effects

A model of a lithium-ion battery containing a cosolvent electrolyte is developed and implemented within the open-source PyBaMM platform. Lithium-ion electrolytes are essential to battery operation and normally contain at least two solvents to satisfy performance requirements. The widely used Doyle-Fuller-Newman battery model assumes that the electrolyte comprises a salt dissolved in a single effective solvent, however. This single-solvent approximation has been disproved experimentally and may hinder accurate battery modelling. Here, we present a two-solvent model that resolves the transport of ethylene carbonate (EC) and lithium salt in a background linear carbonate. EC concentration polarization opposes that of Li+ during cycling, affecting local electrolyte properties and cell-level overpotentials. Concentration gradients of Li+ can be affected by cross-diffusion, whereby EC gradients enhance or impede salt flux. A rationally parametrized model that includes EC transport predicts 6% more power loss at 4.5C discharge and ~0.32% more capacity loss after a thousand 1C cycles than its single-solvent equivalent. This work provides a tool to model more transport behaviour in the electrolyte that may affect degradation and enables the transfer of microscopic knowledge about solvation structure-dependent performance to the macroscale.

physics.chem-ph↗

Ranking with Slot Constraints

We introduce the problem of ranking with slot constraints, which can be used to model a wide range of application problems -- from college admission with limited slots for different majors, to composing a stratified cohort of eligible participants in a medical trial. We show that the conventional Probability Ranking Principle (PRP) can be highly sub-optimal for slot-constrained ranking problems, and we devise a new ranking algorithm, called MatchRank. The goal of MatchRank is to produce rankings that maximize the number of filled slots if candidates are evaluated by a human decision maker in the order of the ranking. In this way, MatchRank generalizes the PRP, and it subsumes the PRP as a special case when there are no slot constraints. Our theoretical analysis shows that MatchRank has a strong approximation guarantee without any independence assumptions between slots or candidates. Furthermore, we show how MatchRank can be implemented efficiently. Beyond the theoretical guarantees, empirical evaluations show that MatchRank can provide substantial improvements over a range of synthetic and real-world tasks.

cs.IR↗

Can Authorship Representation Learning Capture Stylistic Features?

Automatically disentangling an author's style from the content of their writing is a longstanding and possibly insurmountable problem in computational linguistics. At the same time, the availability of large text corpora furnished with author labels has recently enabled learning authorship representations in a purely data-driven manner for authorship attribution, a task that ostensibly depends to a greater extent on encoding writing style than encoding content. However, success on this surrogate task does not ensure that such representations capture writing style since authorship could also be correlated with other latent variables, such as topic. In an effort to better understand the nature of the information these representations convey, and specifically to validate the hypothesis that they chiefly encode writing style, we systematically probe these representations through a series of targeted experiments. The results of these experiments suggest that representations learned for the surrogate authorship prediction task are indeed sensitive to writing style. As a consequence, authorship representations may be expected to be robust to certain kinds of data shift, such as topic drift over time. Additionally, our findings may open the door to downstream applications that require stylistic representations, such as style transfer.

cs.CL↗

Designing Materials Acceleration Platforms for Heterogeneous CO2 Photo(thermal)catalysis

Materials acceleration platforms (MAPs) combine automation and artificial intelligence to accelerate the discovery of molecules and materials. They have potential to play a role in addressing complex societal problems such as climate change. Solar chemicals and fuels generation via heterogeneous CO2 photo(thermal)catalysis is a relatively unexplored process that holds potential for contributing towards an environmentally and economically sustainable future, and therefore a very promising application for MAP science and engineering. Here, we present a brief overview of how design and innovation in heterogeneous CO2 photo(thermal)catalysis, from materials discovery to engineering and scale-up, could benefit from MAPs. We discuss relevant design and performance descriptors and the level of automation of state-of-the-art experimental techniques, and we review examples of artificial intelligence in data analysis. Based on these precedents, we finally propose a MAP outline for autonomous and accelerated discoveries in the emerging field of solar chemicals and fuels sourced from CO2 photo(thermal)catalysis.

cond-mat.mtrl-sci↗

Boosted Prompt Ensembles for Large Language Models

Methods such as chain-of-thought prompting and self-consistency have pushed the frontier of language model reasoning performance with no additional training. To further improve performance, we propose a prompt ensembling method for large language models, which uses a small dataset to construct a set of few shot prompts that together comprise a ``boosted prompt ensemble''. The few shot examples for each prompt are chosen in a stepwise fashion to be ``hard'' examples on which the previous step's ensemble is uncertain. We show that this outperforms single-prompt output-space ensembles and bagged prompt-space ensembles on the GSM8k and AQuA datasets, among others. We propose both train-time and test-time versions of boosted prompting that use different levels of available annotation and conduct a detailed empirical study of our algorithm.

cs.CL↗

Online variable-weight scheduling with preempting on jobs with linear and exponential penalties

We analyze the problem of job scheduling with preempting on weighted jobs that can have either linear or exponential penalties. We review relevant literature on the problem and create and describe a few online algorithms that perform competitively with the optimal scheduler. We first describe a na{\" i}ve algorithm, which yields a high competitive ratio ($Ω(\frac{M}{s_{\min}})$) with the optimal, then provide an algorithm that yields a lower competitive ratio ($4\sqrt{\frac{M}{s_{\min}}} + n\log{\frac{Mn}{s_{\min}}}$). Finally, we make a minor modification to our algorithm to yield an algorithm that has an even better competitive ratio ($n\log{\frac{Mn}{s_{\min}}}$).

cs.DS↗

Operator Splitting Value Iteration

We introduce new planning and reinforcement learning algorithms for discounted MDPs that utilize an approximate model of the environment to accelerate the convergence of the value function. Inspired by the splitting approach in numerical linear algebra, we introduce Operator Splitting Value Iteration (OS-VI) for both Policy Evaluation and Control problems. OS-VI achieves a much faster convergence rate when the model is accurate enough. We also introduce a sample-based version of the algorithm called OS-Dyna. Unlike the traditional Dyna architecture, OS-Dyna still converges to the correct value function in presence of model approximation error.

cs.LG↗

Learning to Imitate Object Interactions from Internet Videos

We study the problem of imitating object interactions from Internet videos. This requires understanding the hand-object interactions in 4D, spatially in 3D and over time, which is challenging due to mutual hand-object occlusions. In this paper we make two main contributions: (1) a novel reconstruction technique RHOV (Reconstructing Hands and Objects from Videos), which reconstructs 4D trajectories of both the hand and the object using 2D image cues and temporal smoothness constraints; (2) a system for imitating object interactions in a physics simulator with reinforcement learning. We apply our reconstruction technique to 100 challenging Internet videos. We further show that we can successfully imitate a range of different object interactions in a physics simulator. Our object-centric approach is not limited to human-like end-effectors and can learn to imitate object interactions using different embodiments, like a robotic arm with a parallel jaw gripper.

cs.CV↗

Shadows Aren't So Dangerous After All: A Fast and Robust Defense Against Shadow-Based Adversarial Attacks

Robust classification is essential in tasks like autonomous vehicle sign recognition, where the downsides of misclassification can be grave. Adversarial attacks threaten the robustness of neural network classifiers, causing them to consistently and confidently misidentify road signs. One such class of attack, shadow-based attacks, causes misidentifications by applying a natural-looking shadow to input images, resulting in road signs that appear natural to a human observer but confusing for these classifiers. Current defenses against such attacks use a simple adversarial training procedure to achieve a rather low 25\% and 40\% robustness on the GTSRB and LISA test sets, respectively. In this paper, we propose a robust, fast, and generalizable method, designed to defend against shadow attacks in the context of road sign recognition, that augments source images with binary adaptive threshold and edge maps. We empirically show its robustness against shadow attacks, and reformulate the problem to show its similarity to $\varepsilon$ perturbation-based attacks. Experimental results show that our edge defense results in 78\% robustness while maintaining 98\% benign test accuracy on the GTSRB test set, with similar results from our threshold defense. Link to our code is in the paper.

cs.CV↗

Material Prediction for Design Automation Using Graph Representation Learning

Successful material selection is critical in designing and manufacturing products for design automation. Designers leverage their knowledge and experience to create high-quality designs by selecting the most appropriate materials through performance, manufacturability, and sustainability evaluation. Intelligent tools can help designers with varying expertise by providing recommendations learned from prior designs. To enable this, we introduce a graph representation learning framework that supports the material prediction of bodies in assemblies. We formulate the material selection task as a node-level prediction task over the assembly graph representation of CAD models and tackle it using Graph Neural Networks (GNNs). Evaluations over three experimental protocols performed on the Fusion 360 Gallery dataset indicate the feasibility of our approach, achieving a 0.75 top-3 micro-f1 score. The proposed framework can scale to large datasets and incorporate designers' knowledge into the learning process. These capabilities allow the framework to serve as a recommendation system for design automation and a baseline for future work, narrowing the gap between human designers and intelligent design agents.

cs.LG↗

Near Real-Time Social Distance Estimation in London

During the COVID-19 pandemic, policy makers at the Greater London Authority, the regional governance body of London, UK, are reliant upon prompt and accurate data sources. Large well-defined heterogeneous compositions of activity throughout the city are sometimes difficult to acquire, yet are a necessity in order to learn 'busyness' and consequently make safe policy decisions. One component of our project within this space is to utilise existing infrastructure to estimate social distancing adherence by the general public. Our method enables near immediate sampling and contextualisation of activity and physical distancing on the streets of London via live traffic camera feeds. We introduce a framework for inspecting and improving upon existing methods, whilst also describing its active deployment on over 900 real-time feeds.

cs.CY↗

SELFIES and the future of molecular string representations

Artificial intelligence (AI) and machine learning (ML) are expanding in popularity for broad applications to challenging tasks in chemistry and materials science. Examples include the prediction of properties, the discovery of new reaction pathways, or the design of new molecules. The machine needs to read and write fluently in a chemical language for each of these tasks. Strings are a common tool to represent molecular graphs, and the most popular molecular string representation, SMILES, has powered cheminformatics since the late 1980s. However, in the context of AI and ML in chemistry, SMILES has several shortcomings -- most pertinently, most combinations of symbols lead to invalid results with no valid chemical interpretation. To overcome this issue, a new language for molecules was introduced in 2020 that guarantees 100\% robustness: SELFIES (SELF-referencIng Embedded Strings). SELFIES has since simplified and enabled numerous new applications in chemistry. In this manuscript, we look to the future and discuss molecular string representations, along with their respective opportunities and challenges. We propose 16 concrete Future Projects for robust molecular representations. These involve the extension toward new chemical domains, exciting questions at the interface of AI and robust languages and interpretability for both humans and machines. We hope that these proposals will inspire several follow-up works exploiting the full potential of molecular string representations for the future of AI in chemistry and materials science.

physics.chem-ph↗

Simultaneous Detection of Optical Flares of the Magnetically Active M Dwarf Wolf 359

We present detections of stellar flares of Wolf\,359, an M6.5 dwarf in the solar neighborhood (2.41~pc) known to be prone to flares due to surface magnetic activity. The observations were carried out from 2020 April 23 to 29 with a 1-m and a 0.5-m telescope separated by nearly 300~km in Xinjiang, China. In 27~hr of photometric monitoring, a total of 13 optical flares were detected, each with a total energy of $\gtrsim 5 \times 10^{29}$~erg. The measured event rate of about once every two hours is consistent with those reported previously in radio, X-ray and optical wavelengths for this star. One such flare, detected by both telescopes on 26 April, was an energetic event with a released energy of nearly $10^{33}$~erg. The two-telescope lightcurves of this major event sampled at different cadences and exposure timings enabled us to better estimate the intrinsic flare profile, which reached a peak of up to 1.6 times the stellar quiescent brightness, that otherwise would have been underestimated in the observed flare amplitudes of about $0.4$ and $0.8$, respectively, with single telescopes alone. The compromise between fast sampling so as to resolve a flare profile versus a longer integration time for higher photometric signal-to-noise provides a useful guidance in the experimental design of future flare observations.

astro-ph.SR↗

Robust classification with flexible discriminant analysis in heterogeneous data

Linear and Quadratic Discriminant Analysis are well-known classical methods but can heavily suffer from non-Gaussian distributions and/or contaminated datasets, mainly because of the underlying Gaussian assumption that is not robust. To fill this gap, this paper presents a new robust discriminant analysis where each data point is drawn by its own arbitrary Elliptically Symmetrical (ES) distribution and its own arbitrary scale parameter. Such a model allows for possibly very heterogeneous, independent but non-identically distributed samples. After deriving a new decision rule, it is shown that maximum-likelihood parameter estimation and classification are very simple, fast and robust compared to state-of-the-art methods.

stat.ML↗

Simple Text Detoxification by Identifying a Linear Toxic Subspace in Language Model Embeddings

Large pre-trained language models are often trained on large volumes of internet data, some of which may contain toxic or abusive language. Consequently, language models encode toxic information, which makes the real-world usage of these language models limited. Current methods aim to prevent toxic features from appearing generated text. We hypothesize the existence of a low-dimensional toxic subspace in the latent space of pre-trained language models, the existence of which suggests that toxic features follow some underlying pattern and are thus removable. To construct this toxic subspace, we propose a method to generalize toxic directions in the latent space. We also provide a methodology for constructing parallel datasets using a context based word masking system. Through our experiments, we show that when the toxic subspace is removed from a set of sentence representations, almost no toxic representations remain in the result. We demonstrate empirically that the subspace found using our method generalizes to multiple toxicity corpora, indicating the existence of a low-dimensional toxic subspace.

cs.CL↗

Trinity: An Imaging Air Cherenkov Telescope to Search for Ultra-High-Energy Neutrinos

Earth-skimming neutrinos are those which travel through the Earth's crust at a shallow angle. For Ultra-High-Energy (E > 1 PeV; UHE) earth-skimming tau neutrinos, there is a high-probability that the tau lepton created by a neutrino-Earth interaction will emerge from the ground before it decays. When this happens, the decaying tau particle initiates an air shower of relativistic sub-atomic particles which emit Cherenkov radiation. To observe this Cherenkov radiation, we propose the Trinity Observatory. Using a novel optical structure design, pointing at the horizon, Trinity will observe the Cherenkov radiation from upward-going neutrino-induced air showers. Being sensitive to neutrinos in the 1-10,000 PeV energy range, Trinity's expected sensitivity will have a unique role to play filling the gap between the observed astrophysical neutrinos observed by IceCube and the expected sensitivity of radio UHE neutrino detectors.

astro-ph.IM↗