total 1384took 0.11s

Practical optimal experiment design with probabilistic programsAug 17 2016Scientists often run experiments to distinguish competing theories. This requires patience, rigor, and ingenuity - there is often a large space of possible experiments one could run. But we need not comb this space by hand - if we represent our theories ... More

Overtwisted open books from sobering arcsJul 24 2004Oct 11 2005We study open books on three manifolds which are compatible with an overtwisted contact structure. We show that the existence of certain arcs, called sobering arcs, is a sufficient condition for an open book to be overtwisted, and is necessary up to stabilization ... More

Tensor Variable Elimination for Plated Factor GraphsFeb 08 2019May 17 2019A wide class of machine learning algorithms can be reduced to variable elimination on factor graphs. While factor graphs provide a unifying notation for these algorithms, they do not provide a compact way to express repeated structure when compared to ... More

Generative Grading: Neural Approximate Parsing for Automated Student FeedbackMay 23 2019Open access to high-quality education is limited by the difficulty of providing student feedback. In this paper, we present Generative Grading with Neural Approximate Parsing (GG-NAP): a novel approach for providing feedback at scale that is capable of ... More

Multimodal Generative Models for Scalable Weakly-Supervised LearningFeb 14 2018Nov 12 2018Multiple modalities often co-occur when describing natural phenomena. Learning a joint representation of these modalities should yield deeper and more useful representations. Previous generative approaches to multi-modal input either do not learn a joint ... More

On the stable equivalence of open books in three-manifoldsSep 23 2005Mar 03 2009We show that two open books in a given closed, oriented three-manifold admit isotopic stabilizations, where the stabilization is made by successive plumbings with Hopf bands, if and only if their associated plane fields are homologous. Since this condition ... More

A Dynamic Programming Algorithm for Inference in Recursive Probabilistic ProgramsJun 15 2012Sep 10 2012We describe a dynamic programming algorithm for computing the marginal distribution of discrete probabilistic programs. This algorithm takes a functional interpreter for an arbitrary probabilistic programming language and turns it into an efficient marginalizer. ... More

Lost in Machine Translation: A Method to Reduce Meaning LossFeb 25 2019Apr 23 2019A desideratum of high-quality translation systems is that they preserve meaning, in the sense that two sentences with different meanings should not translate to one and the same sentence in another language. However, state-of-the-art systems often fail ... More

Lost in Machine Translation: A Method to Reduce Meaning LossFeb 25 2019A desideratum of high-quality translation systems is that they preserve meaning, in the sense that two sentences with different meanings should not translate to one and the same sentence in another language. However, state-of-the-art systems often fail ... More

Lost in Machine Translation: A Method to Reduce Meaning LossFeb 25 2019Apr 12 2019A desideratum of high-quality translation systems is that they preserve meaning, in the sense that two sentences with different meanings should not translate to one and the same sentence in another language. However, state-of-the-art systems often fail ... More

A pragmatic theory of generic languageAug 09 2016Aug 26 2016Generalizations about categories are central to human understanding, and generic language (e.g. "Dogs bark.") provides a simple and ubiquitous way to communicate these generalizations. Yet the meaning of generic language is philosophically puzzling and ... More

Inducing Probabilistic Programs by Bayesian Program MergingOct 25 2011This report outlines an approach to learning generative models from data. We express models as probabilistic programs, which allows us to capture abstract patterns within the examples. By choosing our language for programs to be an extension of the algebraic ... More

Deep Amortized Inference for Probabilistic ProgramsOct 18 2016Probabilistic programming languages (PPLs) are a powerful modeling tool, able to represent any computable probability distribution. Unfortunately, probabilistic program inference is often intractable, and existing PPLs mostly rely on expensive, approximate ... More

Learning to Generate Compositional Color DescriptionsJun 13 2016Oct 18 2016The production of color language is essential for grounded language generation. Color descriptions have many challenging properties: they can be vague, compositionally complex, and denotationally rich. We present an effective approach to generating color ... More

Learning the Preferences of Ignorant, Inconsistent AgentsDec 18 2015An important use of machine learning is to learn what people value. What posts or photos should a user be shown? Which jobs or activities would a person find rewarding? In each case, observations of people's past choices can inform our inferences about ... More

Differentiable Antithetic Sampling for Variance Reduction in Stochastic Variational InferenceOct 05 2018Stochastic optimization techniques are standard in variational inference algorithms. These methods estimate gradients by approximating expectations with independent Monte Carlo samples. In this paper, we explore a technique that uses correlated, but more ... More

Planning, Inference and Pragmatics in Sequential Language GamesMay 30 2018We study sequential language games in which two players, each with private information, communicate to achieve a common goal. In such games, a successful player must (i) infer the partner's private information from the partner's messages, (ii) generate ... More

C3: Lightweight Incrementalized MCMC for Probabilistic Programs using Continuations and Callsite CachingSep 07 2015Sep 08 2015Lightweight, source-to-source transformation approaches to implementing MCMC for probabilistic programming languages are popular for their simplicity, support of existing deterministic code, and ability to execute on existing fast runtimes. However, they ... More

Groups with a Character of Large DegreeMar 10 2006Aug 28 2008Let G be a finite group of order n and V an irreducible representation over the complex numbers of dimension d. For some nonnegative number e, we have n=d(d+e). If e is small, then the character of V has unusually large degree. We fix e and attempt to ... More

Learning to Explain: Answering Why-Questions via RephrasingJun 04 2019Providing plausible responses to why questions is a challenging but critical goal for language based human-machine interaction. Explanations are challenging in that they require many different forms of abstract knowledge and reasoning. Previous work has ... More

Pragmatic inference and visual abstraction enable contextual flexibility during visual communicationMar 11 2019Mar 28 2019Visual modes of communication are ubiquitous in modern life --- from maps to data plots to political cartoons. Here we investigate drawing, the most basic form of visual communication. Participants were paired in an online environment to play a drawing-based ... More

UV sky surveysJul 26 1998I review the development of UV and EUV astronomy, covering the spectral range from 5 to 300 nm, with emphasis on sky surveys for discrete sources. I discuss studies which resulted in lists of sources observed by imaging and deliberately omit most spectroscopic ... More

Modeling and Particle Tracking through Longitudinal Gradient Bending MagnetsOct 26 2015This report documents the development of a versatile model for longitudinal gradient bending magnets (LGB's) and its implementation in particle tracking simulations. The model presented below may be used to represent an arbitrary magnetic field profile, ... More

Intentional Design for EmpowermentAug 27 2013I argue for empowering education, adapting Marx's idea of ownership of the means of production, and discuss interactive simulations as one example of a tool in which intentional design can support student ownership of learning. I propose a model that ... More

Acyclic Colorings of Directed GraphsSep 26 2014The acyclic chromatic number of a directed graph $D$, denoted $\chi_A(D)$, is the minimum positive integer $k$ such that there exists a decomposition of the vertices of $D$ into $k$ disjoint sets, each of which induces an acyclic subgraph. For any $m ... More

The monodromy of real Bethe vectors for the Gaudin modelNov 15 2015The Bethe algebras for the Gaudin model act on the multiplicity space of tensor products of irreducible $ \mathfrak{gl}_r $-modules and have simple spectrum over real points. This fact is proved by Mukhin, Tarasov and Varchenko who also develop a relationship ... More

Transfinite Recursion in Higher Reverse MathematicsOct 22 2013In this paper we investigate the reverse mathematics of higher-order analogues of the theory \ATRz{} within the framework of higher order reverse mathematics developed by Kohlenbach \cite{Koh01}. We define a theory \RCAzthr, a close higher-type analogue ... More

Ultraviolet Sky SurveysSep 29 1996Sep 30 1996I review the development of UV and EUV astronomy, covering the spectral range from 5 to 300 nm, with emphasis on sky surveys for discrete sources. I discuss studies which resulted in lists of sources observed by imaging. The missions are compared in terms ... More

A Fibonacci summation formula from the Verlinde formulaApr 22 2019There is a family of vector bundles over the moduli space of stable curves that, while first appearing in theoretical physics, has been an active topic of study for algebraic geometers since the 1990s. By computing the rank of the exceptional group $G_2$ ... More

Electromagnetic Casimir Forces in Elliptic Cylinder GeometriesMar 26 2013The scattering theory approach makes it possible to carry out exact calculations of Casimir energies in any geometry for which the scattering T-matrix and a partial wave expansion of the free Green's function are available. We implement this program for ... More

Classes for Fast Maximum Entropy TrainingAug 09 2001Maximum entropy models are considered by many to be one of the most promising avenues of language modeling research. Unfortunately, long training times make maximum entropy research difficult. We present a novel speedup technique: we change the form of ... More

Parsing Inside-OutMay 19 1998The inside-outside probabilities are typically used for reestimating Probabilistic Context Free Grammars (PCFGs), just as the forward-backward probabilities are typically used for reestimating HMMs. I show several novel uses, including improving parser ... More

Radio scintillation of gamma-ray-burst afterglowsJun 09 1997Stars twinkle to the eye through atmospheric turbulence, but planets, because of their larger angular size, do not. Similarly, scintillation due to the local interstellar medium will modulate the radio flux of gamma-ray-burst afterglows and may permit ... More

Restrictions on endomorphism rings of jacobians and their minimal fields of definitionJan 17 2019We use tools from representation theory to give simple, easy to verify weak conditions for `upper bounds' on endomorphism rings of certain jacobians defined over a number field $K$. For example, we provide easy to check conditions for such a jacobian ... More

Restrictions on endomorphism rings of jacobians and their minimal fields of definitionJan 17 2019Apr 16 2019Zarhin has extensively studied restrictions placed on the endomorphism algebras of Jacobians $J$ for which the Galois group associated to their 2-torsion is insoluble and 'large' (relative to the dimension of $J$). In this paper we examine what happens ... More

Exponential growth of ponds in invasion percolation on regular treesDec 28 2009In invasion percolation, the edges of successively maximal weight (the outlets) divide the invasion cluster into a chain of ponds separated by outlets. On the regular tree, the ponds are shown to grow exponentially, with law of large numbers, central ... More

An Incremental Iterated Response Model of PragmaticsSep 30 2018Oct 19 2018Recent Iterated Response (IR) models of pragmatics conceptualize language use as a recursive process in which agents reason about each other to increase communicative efficiency. These models are generally defined over complete utterances. However, there ... More

DisSent: Sentence Representation Learning from Explicit Discourse RelationsOct 12 2017May 14 2019Learning effective representations of sentences is one of the core missions of natural language understanding. Existing models either train on a vast amount of text, or require costly, manually curated sentence relation datasets. We show that with dependency ... More

Neurally-Guided Procedural Models: Amortized Inference for Procedural Graphics Programs using Neural NetworksMar 19 2016Oct 13 2016Probabilistic inference algorithms such as Sequential Monte Carlo (SMC) provide powerful tools for constraining procedural models in computer graphics, but they require many samples to produce desirable results. In this paper, we show how to create procedural ... More

Applying Probabilistic Programming to Affective ComputingMar 15 2019Affective Computing is a rapidly growing field spurred by advancements in artificial intelligence, but often, held back by the inability to translate psychological theories of emotion into tractable computational models. To address this, we propose a ... More

The Infinite Latent Events ModelMay 09 2012We present the Infinite Latent Events Model, a nonparametric hierarchical Bayesian distribution over infinite dimensional Dynamic Bayesian Networks with binary state representations and noisy-OR-like transitions. The distribution can be used to learn ... More

Pragmatic inference and visual abstraction enable contextual flexibility during visual communicationMar 11 2019Visual modes of communication are ubiquitous in modern life. Here we investigate drawing, the most basic form of visual communication. Communicative drawing poses a core challenge for theories of how vision and social cognition interact, requiring a detailed ... More

Meta-Amortized Variational Inference and LearningFeb 05 2019How can we learn to do probabilistic inference in a way that generalizes between models? Amortized variational inference learns for a single model, sharing statistical strength across observations. This benefits scalability and model learning, but does ... More

Zero Shot Learning for Code Education: Rubric Sampling with Deep Learning InferenceSep 05 2018Dec 17 2018In modern computer science education, massive open online courses (MOOCs) log thousands of hours of data about how students solve coding challenges. Being so rich in data, these platforms have garnered the interest of the machine learning community, with ... More

Speakers account for asymmetries in visual perspective so listeners don't have toJul 24 2018Oct 22 2018Debates over adults' theory of mind use have been fueled by surprising failures of visual perspective-taking in simple communicative tasks. Motivated by recent computational models of context-sensitive language use, we reconsider the evidence in light ... More

DisSent: Sentence Representation Learning from Explicit Discourse RelationsOct 12 2017Jun 04 2019Learning effective representations of sentences is one of the core missions of natural language understanding. Existing models either train on a vast amount of text, or require costly, manually curated sentence relation datasets. We show that with dependency ... More

Thinking about ArcheoastronomyMar 29 2011I discuss various aspects of archeoastronomy concentrating on physical artifacts (i.e., not including ethno-archeoastronomy) focusing on the period that ended about 2000 years ago. I present examples of artifacts interpreted as showing the interest of ... More

Quest for truly isolated galaxiesJun 23 2009I describe attempts to identify and understand the most isolated galaxies starting from my 1983 Leiden PhD thesis, continuing through a string of graduate theses on various aspects of this topic, and concluding with an up-to-date account of the difficulty ... More

The TAUVEX UV ImagerSep 30 1996I present an up-to-date description of the TAUVEX UV imager, constructed to operate on the Spectrum X-Gamma international space observatory. The projected performance and the expected scientific yield of TAUVEX are described.

Casimir Energies of Periodic Dielectric GratingsJul 17 2014Sep 23 2014Reflection of electromagnetic waves from a periodic grating can be described in terms of a discrete coupled multichannel scattering problem. By modeling the grating as a space- and frequency-dependent dielectric, it is possible to use a variable phase ... More

The dual complex of $\bar{M}_{0,n}$ via phylogeneticsDec 01 2015May 09 2016The moduli space $\bar{M}_{0,n}$ of stable rational n-pointed curves has divisorial boundary with simple normal crossings. In this brief note I observe that the dual complex is a flag complex; that is, a collection of irreducible boundary divisors has ... More

Brownian bricklayer: a random space-filling curveAug 23 2017Let $(B(t),\,t\ge0)$ denote the standard, one-dimensional Wiener process and $(\ell(y,t);\, y\in\mathbb{R},\, t\ge0)$ its local time at level $y$ up to time $t$. Then $\big( (B(t),\, \ell(B(t),t)),\; t\ge0 \big)$ is a random path that fills the upper ... More

Seeing ScienceNov 17 2009The ability to represent scientific data and concepts visually is becoming increasingly important due to the unprecedented exponential growth of computational power during the present digital age. The data sets and simulations scientists in all fields ... More

Concerning thermal tides on hot JupitersJan 21 2009By analogy with a mechanism proposed by Gold and Soter to explain the retrograde rotation of Venus, Arras and Socrates suggest that thermal tides may excite hot jovian exoplanets into nonsynchronous rotation, and perhaps also noncircular orbits. It is ... More

Global Thresholding and Multiple Pass ParsingAug 13 1997Aug 15 1997We present a variation on classic beam thresholding techniques that is up to an order of magnitude faster than the traditional method, at the same performance level. We also present a new thresholding technique, global thresholding, which, combined with ... More

Extended Comment on Language Trees and ZippingFeb 21 2002This is the extended version of a Comment submitted to Physical Review Letters. I first point out the inappropriateness of publishing a Letter unrelated to physics. Next, I give experimental results showing that the technique used in the Letter is 3 times ... More

A Bit of Progress in Language ModelingAug 09 2001In the past several years, a number of different language modeling improvements over simple trigram models have been found, including caching, higher-order n-grams, skipping, interpolated Kneser-Ney smoothing, and clustering. We present explorations of ... More

New Projects in Underground PhysicsJul 08 2003A large fraction of neutrino research is taking place in facilities underground. In this paper, I review the underground facilities for neutrino research. I discuss ideas for future reactor experiments being considered to measure theta_13 and the UNO ... More

New Reactor Neutrino Experiments besides Double-CHOOZJan 21 2005Several new reactor neutrino experiments are being considered to measure the parameter theta-13. The current plans for Angra, Braidwood, Daya Bay, KASKA and KR2DET are reviewed. A case is made that, together with Double-CHOOZ, a future world program should ... More

Plans for Experiments to Measure $θ_{13}$Apr 23 2004New experiments at accelerators and reactors are being designed to search for a possible non-zero value of the MNS matrix parameter theta_{13}.

Inhomogeneous Quantum WalksJun 19 2009We study a natural construction of a general class of inhomogeneous quantum walks (namely walks whose transition probabilities depend on position). Within the class we analyze walks that are periodic in position and show that, depending on the period, ... More

Measurement entropy in Generalized Non-Signalling Theory cannot detect bipartite non-localityJul 13 2012Nov 13 2012We consider entropy in Generalized Non-Signalling Theory (also known as box world) where the most common definition of entropy is the measurement entropy. In this setting, we completely characterize the set of allowed entropies for a bipartite state. ... More

Hypergraph VersalsFeb 04 2016Let H be a hypergraph on n vertices with the property that no edge contains another. We prove some results for a special case of the Isolation Lemma when the label set for the edges of H can only take two values. Given any set of vertices S and an edge ... More

A time-distance trade-off for GDD with preprocessing---Instantiating the DLW heuristicFeb 22 2019For $0 \leq \alpha \leq 1/2$, we show an algorithm that does the following. Given appropriate preprocessing $P(\mathcal{L})$ consisting of $N_\alpha := 2^{O(n^{1-2\alpha} + \log n)}$ vectors in some lattice $\mathcal{L} \subset \mathbb{R}^n$ and a target ... More

Principal component analysis of IUE galaxy spectraFeb 12 2004We analyse the UV spectral energy distribution of a sample of normal galaxies listed in the IUE-INES Guide No. 2-Normal Galaxies (Formiggini & Brosch, 2000) using a Principal Component Analysis. The sample consists of the IUE-SW spectra of the central ... More

From Poland to "Petersburg": The Banach-Tarski Paradox in Bely's Modernist NovelOct 16 2017Andrei Bely's novel "Petersburg," first published in 1913, was declared by Vladimir Nabokov one of the four greatest masterpieces of 20th-century prose. The Banach-Tarski Paradox, published in 1924, is one of the most striking and well-known results in ... More

An analysis of the cost of hyper-parameter selection via split-sample validation, with applications to penalized regressionMar 28 2019In the regression setting, given a set of hyper-parameters, a model-estimation procedure constructs a model from training data. The optimal hyper-parameters that minimize generalization error of the model are usually unknown. In practice they are often ... More

Gradient-based Regularization Parameter Selection for Problems with Non-smooth Penalty FunctionsMar 28 2017In high-dimensional and/or non-parametric regression problems, regularization (or penalization) is used to control model complexity and induce desired structure. Each penalty has a weight parameter that indicates how strongly the structure corresponding ... More

Bias and Generalization in Deep Generative Models: An Empirical StudyNov 08 2018In high dimensional settings, density estimation algorithms rely crucially on their inductive bias. Despite recent empirical success, the inductive bias of deep generative models is not well understood. In this paper we propose a framework to systematically ... More

A Simple Isolation Criterion based on 3D Redshift Space MappingSep 22 2009We selected a sample of galaxies, extremely isolated in 3D redshift space, based on data from NED and the ongoing ALFALFA HI (21cm) survey. A simple selection criterion was employed: having no neighbors closer than 300 km/s in 3D redshift space. The environments ... More

Comment on "Detecting Novel Associations In Large Data Sets" by Reshef Et Al, Science Dec 16, 2011Jan 29 2014The proposal of Reshef et al. (2011) is an interesting new approach for discovering non-linear dependencies among pairs of measurements in exploratory data mining. However, it has a potentially serious drawback. The authors laud the fact that MIC has ... More

Adversarial Evaluation for Models of Natural LanguageJul 01 2012Jul 15 2012We now have a rich and growing set of modeling tools and algorithms for inducing linguistic structure from text that is less than fully annotated. In this paper, we discuss some of the weaknesses of our current methodology. We present a new abstract framework ... More

A Permutation Approach to Testing Interactions in Many DimensionsJun 27 2012To date, testing interactions in high dimensions has been a challenging task. Existing methods often have issues with sensitivity to modeling assumptions and heavily asymptotic nominal p-values. To help alleviate these issues, we propose a permutation-based ... More

Good dynamics versus bad kinematics. Is entanglement needed for quantum computation?Jun 01 1999Jun 03 1999We consider quantum computing with pseudo-pure states. This framework arises in certain implementations of quantum computing using NMR. We analyze quantum computational protocols which aim to solve exponential classical problems with polynomial resources ... More

On the role of entanglement in quantum computational speed-upJan 30 2002Mar 08 2002For any quantum algorithm operating on pure states we prove that the presence of multi-partite entanglement, with a number of parties that increases unboundedly with input size, is necessary if the quantum algorithm is to offer an exponential speed-up ... More

The Halting Problem for Quantum ComputersJun 16 1998Jun 29 1998We argue that the halting problem for quantum computers which was first raised by Myers, is by no means solved, as has been claimed recently. We explicitly demonstrate the difficulties that arise in a quantum computer when different branches of the computation ... More

The Chen-Gibney-Krashen moduli space as a Chow quotientSep 11 2015The space of n distinct points and a disjoint parameterized hyperplane in projective d-space up to projectivity---equivalently, configurations of n distinct points in affine d-space up to translation and homothety---has a beautiful compactification introduced ... More

Nonnegative Tensor Factorization for Directional Blind Audio Source SeparationNov 18 2014We augment the nonnegative matrix factorization method for audio source separation with cues about directionality of sound propagation. This improves separation quality greatly and removes the need for training data, but doubles the computation.

Exact Electromagnetic Casimir Energy of a Disk Opposite a PlaneJun 03 2016Sep 08 2016Building on work of Meixner [J. Meixner, Z. Naturforschung 3a, 506 (1948)], we show how to compute the exact scattering amplitude (or $T$-matrix) for electromagnetic scattering from a perfectly conducting disk. This calculation is a rare example of a ... More

Robust Constraint of Luminosity Function Evolution Through MCMC SamplingJul 03 2014Sep 30 2014We present a new galaxy survey simulation package, which combines the power of Markov Chain Monte Carlo (MCMC) sampling with a robust and adaptable model of galaxy evolution. The aim of this code is to aid in the characterization and study of new and ... More

Geometry in the CourtroomSep 17 2017There has been a recent media blitz on a cohort of mathematicians valiantly working to fix America's democratic system by combatting gerrymandering with geometry. While statistics commonly features in the courtroom (forensics, DNA analysis, etc.), the ... More

Subfactors of index less than 5, part 1: the principal graph odometerJul 10 2010Feb 23 2011In this series of papers we show that there are exactly ten subfactors, other than $A_\infty$ subfactors, of index between 4 and 5. Previously this classification was known up to index $3+\sqrt{3}$. In the first paper we give an analogue of Haagerup's ... More

Computational geometry and the U.S. Supreme CourtOct 27 2018We use the United States Supreme Court as an illuminative context in which to discuss three different spatial voting preference models: an instance of the widely used single-peaked preferences, and two models that are more novel in which vote outcomes ... More

Polynomial Identities on EigenformsOct 14 2013Dec 17 2014In this paper, we fix a polynomial with complex coefficients and determine the eigenforms for SL2(Z) which can be expressed as the fixed polynomial evaluated at other eigenforms. In particular, we show that when one excludes trivial cases, only finitely ... More

A Grassmann algebra for matroidsOct 15 2015Sep 14 2017We introduce an idempotent analogue of the exterior algebra for which the theory of tropical linear spaces (and valuated matroids) can be seen in close analogy with the classical Grassmann algebra formalism for linear spaces. The top wedge power of a ... More

Sparse-Input Neural Networks for High-dimensional Nonparametric Regression and ClassificationNov 21 2017Jun 21 2019Neural networks are usually not the tool of choice for nonparametric high-dimensional problems where the number of input features is much larger than the number of observations. Though neural networks can approximate complex multivariate functions, they ... More

Complex Objects in the Polytopes of the Linear State-Space ProcessJan 21 2014A simple object (one point in $m$-dimensional space) is the resultant of the evolving matrix polynomial of walks in the irreducible aperiodic network structure of the first order DeGroot (weighted averaging) state-space process. This paper draws on a ... More

Grey Milky Way Extinction from SDSS Stellar PhotometrySep 01 2009We report results concerning the distribution and properties of galactic extinction at high galactic latitudes derived from stellar statistics using the Sloan Digital Sky Survey (SDSS). We use the classical Wolf diagram method to identify regions with ... More

A presentation of the deformed W_{1+\infty} algebraSep 03 2012We provide a generators and relation description of the deformed W_{1+\infty}-algebra introduced in previous joint work of E. Vasserot and the second author. This gives a presentation of the (spherical) cohomological Hall algebra of the one-loop quiver, ... More

Discriminant Analysis with Adaptively Pooled CovarianceNov 07 2011Dec 06 2011Linear and Quadratic Discriminant analysis (LDA/QDA) are common tools for classification problems. For these methods we assume observations are normally distributed within group. We estimate a mean and covariance matrix for each group and classify using ... More

Bell nonlocality and Bayesian game theoryOct 03 2012We discuss a connection between Bell nonlocality and Bayesian games. This link offers interesting perspectives for Bayesian games, namely to allow the players to receive advice in the form of nonlocal correlations, for instance using entangled quantum ... More

Quantum communication beyond the localization length in disordered spin chainsJan 31 2008We study the effects of localization on quantum state transfer in spin chains. We show how to use quantum error correction and multiple parallel spin chains to send a qubit with high fidelity over arbitrary distances; in particular distances much greater ... More

Quantum temporal logic and decoherence functionals in the histories approach to generalised quantum theoryMay 11 1994We analyse and develop the recent suggestion that a temporal form of quantum logic provides the natural mathematical framework within which to discuss the proposal by Gell-Mann and Hartle for a generalised form of quantum theory based on the ideas of ... More

Preparing graduate students to be educatorsSep 01 2006We present two programs that address needs to better prepare graduate students for their roles as professional physicists, particularly in the areas of teaching and education research. The two programs, Preparing Future Physicists (PFP) and a course, ... More

Radiatively induced symmetry breaking and the conformally coupled magnetic monopole in AdS spaceOct 29 2013We implement quantum corrections for a magnetic monopole in a classically conformally invariant theory containing gravity. This yields the trace (conformal) anomaly and introduces a length scale in a natural fashion via the process of renormalization. ... More

Normal Galaxies - INES Guide No. 2Feb 12 2004This guide presents, in a uniform manner, all the information collected by the IUE satellite on normal galaxies. It contains information on 274 galaxies and it supersedes the previous IUE guide to normal galaxies (Longo & Capaccioli 1992). The data shown ... More

Transition To Order After Hilltop InflationJan 24 2014We investigate the rich nonlinear dynamics during the end of hilltop inflation by numerically solving the coupled Klein-Gordon-Friedmann equations in a expanding universe. In particular, we search for coherent, nonperturbative configurations that may ... More

Mathematical Symbolism in a Russian Literary MasterpieceSep 07 2017Andrei Bely's modernist novel "Petersburg," first published in 1913, is considered a pinnacle of the Symbolist movement. Nabokov famously ranked it as one of the four greatest masterpieces of 20th-century prose. The author's father, Bugaev, was an influential ... More

Modeling dynamical scalarization with a resummed post-Newtonian expansionMar 10 2016Mar 13 2016Despite stringent constraints set by astrophysical observations, there remain viable scalar-tensor theories that could be distinguished from general relativity with gravitational-wave detectors. A promising signal predicted in these alternative theories ... More

Neural Discourse Structure for Text CategorizationFeb 07 2017May 06 2017We show that discourse structure, as defined by Rhetorical Structure Theory and provided by an existing discourse parser, benefits text categorization. Our approach uses a recursive neural network and a newly proposed attention mechanism to compute a ... More