Researcher profile

George Pappas

George Pappas contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
13works
0followers
12topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

13 published item(s)

preprint2026arXiv

InfoSFT: Learn More and Forget Less with Information-Aware Token Weighting

Supervised fine-tuning (SFT) provides the standard approach for teaching LLMs new behaviors from offline expert demonstrations. However, standard SFT uniformly fits all samples -- including those with low likelihood under the base model -- which can disproportionately drive training updates toward overfitting specific samples rather than learning the target behavior. Moreover, adapting to these unlikely samples induces substantial policy shifts that degrade prior capabilities. Existing methods mitigate this by filtering, regenerating, or down-weighting low-likelihood data. In doing so, they often suppress precisely the novel behaviors the base model has yet to learn. We propose InfoSFT, a principled weighting scheme for the SFT objective that concentrates learning signals on maximally informative, medium-confidence tokens -- those neither overly familiar to the base model nor too unlikely to cause instability. Requiring only a one-line modification to the standard token-wise loss, InfoSFT demonstrably improves generalization over vanilla SFT and likelihood-weighted baselines across math, code, and chain-of-thought tasks with diverse model families, while better preserving pre-existing capabilities.

preprint2022arXiv

Adaptive Sampling of Latent Phenomena using Heterogeneous Robot Teams (ASLaP-HR)

In this paper, we present an online adaptive planning strategy for a team of robots with heterogeneous sensors to sample from a latent spatial field using a learned model for decision making. Current robotic sampling methods seek to gather information about an observable spatial field. However, many applications, such as environmental monitoring and precision agriculture, involve phenomena that are not directly observable or are costly to measure, called latent phenomena. In our approach, we seek to reason about the latent phenomenon in real-time by effectively sampling the observable spatial fields using a team of robots with heterogeneous sensors, where each robot has a distinct sensor to measure a different observable field. The information gain is estimated using a learned model that maps from the observable spatial fields to the latent phenomenon. This model captures aleatoric uncertainty in the relationship to allow for information theoretic measures. Additionally, we explicitly consider the correlations among the observable spatial fields, capturing the relationship between sensor types whose observations are not independent. We show it is possible to learn these correlations, and investigate the impact of the learned correlation models on the performance of our sampling approach. Through our qualitative and quantitative results, we illustrate that empirically learned correlations improve the overall sampling efficiency of the team. We simulate our approach using a data set of sensor measurements collected on Lac Hertel, in Quebec, which we make publicly available.

preprint2022arXiv

Chaotic photon orbits and shadows of a non-Kerr object described by the Hartle-Thorne spacetime

The data from the event horizon telescope have provided a novel view of the vicinity of the horizon of a black hole (BH), by imaging the region around the light-ring. They have also raised hopes for measuring in the near future, features of the image (or the shadow) related to higher order effects of photons traveling in these regions, such as the appearance of higher order bright rings. While the prospect of measuring these fine features of Kerr BHs is very interesting in itself, there are some even more intriguing prospects for observing novel features of possible non-Kerr objects, in the case that the subjects of our images are not the BH solutions of GR. In the hope of sufficient resolution being available in the future, we explore in this work the structure and properties of null geodesics around a Hartle-Thorne spacetime that includes a deformation from the Kerr spacetime characterised by the quadrupole deformation $δq$. These spacetimes have been found to exhibit a bifurcation of the equatorial light-ring to two off-equatorial light-rings in a range of $δq$s and spin parameters. In addition to this, there is a range of parameters where both the equatorial and the off-equatorial light-rings are present. This results in the formation of a pocket that can trap photons. We investigate the properties of these trapped orbits and find that chaotic behaviour emerges. Some of these chaotic orbits are additionally found to be "sticky" and get trapped close to periodic orbits for long times. We also explore how these novel features affect the shadow and find that the off-equatorial light-rings produce distinctive features that deform its circular shape, while the chaotic behaviour associated to the pocket creates features with fractal structure. These results are shown to be quite general, extending to higher order Hartle-Thorne spacetimes.

preprint2022arXiv

New Horizons for Fundamental Physics with LISA

The Laser Interferometer Space Antenna (LISA) has the potential to reveal wonders about the fundamental theory of nature at play in the extreme gravity regime, where the gravitational interaction is both strong and dynamical. In this white paper, the Fundamental Physics Working Group of the LISA Consortium summarizes the current topics in fundamental physics where LISA observations of GWs can be expected to provide key input. We provide the briefest of reviews to then delineate avenues for future research directions and to discuss connections between this working group, other working groups and the consortium work package teams. These connections must be developed for LISA to live up to its science potential in these areas.

preprint2021arXiv

A Temporal Logic-Based Hierarchical Network Connectivity Controller

In this paper, we consider networks of static sensors with integrated sensing and communication capabilities. The goal of the sensors is to propagate their collected information to every other agent in the network and possibly a human operator. Such a task requires constant communication among all agents which may result in collisions and congestion in wireless communication. To mitigate this issue, we impose locally non-interfering connectivity constraints that must be respected by every agent. We show that these constraints along with the requirement of propagating information in the network can be captured by a Linear Temporal Logic (LTL) framework. Existing temporal logic control synthesis algorithms can be used to design correct-by-construction communication schedules that satisfy the considered LTL formula. Nevertheless, such approaches are centralized and scale poorly with the size of the network. We propose a hierarchical LTL-based algorithm that designs communication schedules that determine which agents should communicate while maximizing network usage. We show that the proposed algorithm is complete and demonstrate its efficiency and scalability through analysis and numerical experiments.

preprint2021arXiv

Fair Robust Assignment using Redundancy

We study the consideration of fairness in redundant assignment for multi-agent task allocation. It has recently been shown that redundant assignment of agents to tasks provides robustness to uncertainty in task performance. However, the question of how to fairly assign these redundant resources across tasks remains unaddressed. In this paper, we present a novel problem formulation for fair redundant task allocation, which we cast as the optimization of worst-case task costs under a cardinality constraint. Solving this problem optimally is NP-hard. We exploit properties of supermodularity to propose a polynomial-time, near-optimal solution. In supermodular redundant assignment, the use of additional agents always improves task costs. Therefore, we provide a solution set that is $α$ times larger than the cardinality constraint. This constraint relaxation enables our approach to achieve a super-optimal cost by using a sub-optimal assignment size. We derive the sub-optimality bound on this cardinality relaxation, $α$. Additionally, we demonstrate that our algorithm performs near-optimally without the cardinality relaxation. We show simulations of redundant assignments of robots to goal nodes on transport networks with uncertain travel times. Empirically, our algorithm outperforms benchmarks, scales to large problems, and provides improvements in both fairness and average utility.

preprint2020arXiv

A new method to constrain neutron star structure from quasi-periodic oscillations

We develop a new method to measure neutron star parameters and derive constraints on the equation of state of dense matter by fitting the frequencies of simultaneous Quasi Periodic Oscillation modes observed in the X-ray flux of accreting neutron stars in low mass X-ray binaries. To this aim we calculate the fundamental frequencies of geodesic motion around rotating neutron stars based on an accurate general-relativistic approximation for their external spacetime. Once the fundamental frequencies are related to the observed frequencies through a QPO model, they can be fit to the data to obtain estimates of the three parameters describing the spacetime, namely the neutron star mass, angular momentum and quadrupole moment. From these parameters we derive information on the neutron star structure and equation of state. We present a proof of principle of our method applied to pairs of kHz QPO frequencies observed from three systems (4U1608-52, 4U0614+09 and 4U1728-34). We identify the kHz QPOs with the azimuthal and the periastron precession frequencies of matter orbiting the neutron star, and via our Bayesian inference technique we derive constraints on the neutrons stars' masses and radii. This method is applicable to other geodesic-frequency-based QPO models.

preprint2020arXiv

Online Learning of the Kalman Filter with Logarithmic Regret

In this paper, we consider the problem of predicting observations generated online by an unknown, partially observed linear system, which is driven by stochastic noise. For such systems the optimal predictor in the mean square sense is the celebrated Kalman filter, which can be explicitly computed when the system model is known. When the system model is unknown, we have to learn how to predict observations online based on finite data, suffering possibly a non-zero regret with respect to the Kalman filter's prediction. We show that it is possible to achieve a regret of the order of $\mathrm{poly}\log(N)$ with high probability, where $N$ is the number of observations collected. Our work is the first to provide logarithmic regret guarantees for the widely used Kalman filter. This is achieved using an online least-squares algorithm, which exploits the approximately linear relation between future observations and past observations. The regret analysis is based on the stability properties of the Kalman filter, recent statistical tools for finite sample analysis of system identification, and classical results for the analysis of least-squares algorithms for time series. Our regret analysis can also be applied for state prediction of the hidden state, in the case of unknown noise statistics but known state-space basis. A fundamental technical contribution is that our bounds hold even for the class of non-explosive systems, which includes the class of marginally stable systems, which was an open problem for the case of online prediction under stochastic noise.

preprint2013arXiv

Optimal Vaccine Allocation to Control Epidemic Outbreaks in Arbitrary Networks

We consider the problem of controlling the propagation of an epidemic outbreak in an arbitrary contact network by distributing vaccination resources throughout the network. We analyze a networked version of the Susceptible-Infected-Susceptible (SIS) epidemic model when individuals in the network present different levels of susceptibility to the epidemic. In this context, controlling the spread of an epidemic outbreak can be written as a spectral condition involving the eigenvalues of a matrix that depends on the network structure and the parameters of the model. We study the problem of finding the optimal distribution of vaccines throughout the network to control the spread of an epidemic outbreak. We propose a convex framework to find cost-optimal distribution of vaccination resources when different levels of vaccination are allowed. We also propose a greedy approach with quality guarantees for the case of all-or-nothing vaccination. We illustrate our approaches with numerical simulations in a real social network.

preprint2012arXiv

An all-purpose metric for the exterior of any kind of rotating neutron star

We have tested the appropriateness of two-soliton analytic metric to describe the exterior of all types of neutron stars, no matter what their equation of state or rotation rate is. The particular analytic solution of the vaccuum Einstein equations proved quite adjustable to mimic the metric functions of all numerically constructed neutron-star models that we used as a testbed. The neutron-star models covered a wide range of stiffness, with regard to the equation of state of their interior, and all rotation rates up to the maximum possible rotation rate allowed for each such star. Apart of the metric functions themselves, we have compared the radius of the innermost stable circular orbit $R_{\rm{ISCO}}$, the orbital frequency $Ω\equiv\frac{dϕ}{dt}$ of circular geodesics, and their epicyclic frequencies $Ω_ρ, Ω_z$, as well as the change of the energy of circular orbits per logarithmic change of orbital frequency $Δ\tilde{E}$. All these quantities, calculated by means of the two-soliton analytic metric, fitted with good accuracy the corresponding numerical ones as in previous analogous comparisons (although previous attempts were restricted to neutron star models with either high or low rotation rates). We believe that this particular analytic solution could be considered as an analytic faithful representation of the gravitation field of any rotating neutron star with such accuracy, that one could explore the interior structure of a neutron star by using this space-time to interpret observations of astrophysical processes that take place around it.

preprint2012arXiv

Matching of analytical and numerical solutions for neutron stars of arbitrary rotation

We demonstrate the results of an attempt to match the two-soliton analytical solution with the numerically produced solutions of the Einstein field equations, that describe the spacetime exterior of rotating neutron stars, for arbitrary rotation. The matching procedure is performed by equating the first four multipole moments of the analytical solution to the multipole moments of the numerical one. We then argue that in order to check the effectiveness of the matching of the analytical with the numerical solution we should compare the metric components, the radius of the innermost stable circular orbit ($R_{ISCO}$), the rotation frequency $Ω\equiv\frac{dϕ}{dt}$ and the epicyclic frequencies $Ω_ρ,\;Ω_z$. Finally we present some results of the comparison.

preprint2012arXiv

Multipole Moments of numerical spacetimes

In this article we present some recent results on identifying correctly the relativistic multipole moments of numerically constructed spacetimes, and the consequences that this correction has on searching for appropriate analytic spacetimes that can approximate well the previously mentioned numerical spacetimes. We also present expressions that give the quadrupole and the spin octupole as functions of the spin parameter of a neutron star for various equations of state and in a range of masses for every equation of state used. These results are relevant for describing the exterior spacetime of rotating neutron stars that are made up of matter obeying realistic equations of state.

preprint2012arXiv

What can quasi-periodic oscillations tell us about the structure of the corresponding compact objects?

We show how one can estimate the multipole moments of the space-time, assuming that the quasi-periodic modulations of the X-ray flux (quasi-periodic oscillations), observed from accreting neutron stars or black holes, are due to orbital and precession frequencies (relativistic precession model). The precession frequencies $Ω_ρ$ and $Ω_z$ can be expressed as expansions on the orbital frequency $Ω$, in which the moments enter the coefficients in a prescribed form. Thus, observations can be fitted to these expressions in order to evaluate the moments. If the compact object is a neutron star, constrains can be imposed on the equation of state. The same analysis can be used for black holes as a test for the validity of the no-hair theorem. Alternatively, instead of fitting for the moments, observations can be matched to frequencies calculated from analytic models that are produced so as to correspond to realistic neutron stars described by various equations of state. Observations can thus be used to constrain the equation of state and possibly other physical parameters (mass, rotation, quadrupole, etc.) Some distinctive features of the frequencies, which become evident by using the analytic models, are discussed.