prompt_front: Now, answer the following question based on the text below, only give me the answer and do not output any other words.

Question: What are some fields in which the inverse problem is encountered?

Read the following text and answer briefly.

Context 1: \section{Introduction}
Given a data set and a model with some unknown parameters, the inverse problem aims to find the values of the model parameters that best fit the data   
In this work, in which we focus on systems of interacting elements,
 the inverse problem concerns  the statistical inference
 of the underling interaction network and of its coupling coefficients from observed data on the dynamics  of the system  
 Versions of this problem are encountered in physics, biology (e g , \cite{Balakrishnan11,Ekeberg13,Christoph14}), social sciences and finance (e g ,\cite{Mastromatteo12,yamanaka_15}), neuroscience (e g , \cite{Schneidman06,Roudi09a,tyrcha_13}), just to cite a few, and are becoming more and more important due to the increase in the amount of data available from these fields \\
 \indent 
 A standard approach used in statistical inference is to predict the interaction couplings by maximizing the likelihood function 
 This technique, however, requires the evaluation of the  
 
   partition function that, in the most general case, concerns a number of computations scaling exponentially with the system size 
  
  
    Boltzmann machine learning uses Monte Carlo sampling to compute the gradients of the Log-likelihood looking for stationary points \cite{Murphy12} but this method is computationally manageable only for small systems  A series of faster approximations, such as naive mean-field, independent-pair approximation \cite{Roudi09a, Roudi09b}, inversion of TAP equations \cite{Kappen98,Tanaka98}, small correlations expansion \cite{Sessak09}, adaptive TAP \cite{Opper01}, adaptive  cluster expansion \cite{Cocco12} or Bethe approximations \cite{Ricci-Tersenghi12, Nguyen12}  have, then, been developed  These techniques take as input means and correlations of observed variables and most of them assume a fully connected graph as underlying connectivity network, or expand  around it by perturbative dilution   In most cases, network reconstruction turns out to  be not accurate for small data sizes and/or when couplings are  strong or, else, if the original interaction network is sparse \\
\indent
 A further method, substantially improving performances for small data, is the so-called Pseudo-Likelyhood Method (PLM) \cite{Ravikumar10}  In Ref  \cite{Aurell12} Aurell and Ekeberg performed a comparison between PLM and some of the just mentioned mean-field-based algorithms on the pairwise interacting Ising-spin  ($\sigma = \pm 1$) model, showing how PLM performs sensitively better, especially on sparse graphs and in the high-coupling limit, i e , for low temperature 
 
 In this work, we aim at performing statistical inference  on a model whose interacting variables are continuous $XY$ spins, i e , $\sigma \equiv \left(\cos \phi,\sin \phi\right)$ with $\phi \in [0, 2\pi )$  The developed tools can, actually, be also straightforward applied  to the $p$-clock model  \cite{Potts52} where the phase $\phi$ takes discretely equispaced $p$ values  in the $2 \pi$ interval, $\phi_a =  a 2 \pi/p$, with $a= 0,1,\dots,p-1$  The $p$-clock model, else called vector Potts model, gives a hierarchy of discretization of the $XY$ model as $p$ increases  For $p=2$, one recovers the Ising model, for $p=4$ the Ashkin-Teller model \cite{Ashkin43}, for $p=6$ the ice-type model \cite{Pauling35,Baxter82} and the eight-vertex model \cite{Sutherland70,Fan70,Baxter71} for $p=8$   
It turns out to be very useful also for numerical implementations of the continuous $XY$ model  
Recent analysis on the multi-body $XY$ model has shown that for a limited number of discrete phase values ($p\sim 16, 32$) the thermodynamic critical properties of the $p\to\infty$ $XY$ limit are promptly recovered \cite{Marruzzo15, Marruzzo16}   
Our main motivation to study statistical inference is that these kind of models have recently turned out to be rather useful in describing the behavior of optical systems, 
including standard mode-locking lasers \cite{Gordon02,Gat04,Angelani07,Marruzzo15} and random lasers \cite{Angelani06a,Leuzzi09a,Antenucci15a,Antenucci15b,Marruzzo16}  
In particular, the inverse problem on the pairwise XY model analyzed here might be of help in recovering images from light propagated through random media  


      This paper is organized as follows: in Sec  \ref{sec:model} we introduce the general model  and we discuss its  derivation also  as a model for light transmission through random scattering media  
    In Sec  \ref{sec:plm} we introduce the PLM with $l_2$ regularization  and with decimation, two variants of the PLM respectively introduced in Ref  \cite{Wainwright06} and \cite{Aurell12} for the inverse Ising problem  
    Here, we analyze these techniques for continuous $XY$ spins and we test them on thermalized data generated by Exchange Monte Carlo numerical simulations of the original model dynamics  In Sec  \ref{sec:res_reg} we  present the results related to the PLM-$l_2$  In Sec  \ref{sec:res_dec} the results related to the PLM with decimation are reported and its performances are compared to the PLM-$l_2$ and to a variational mean-field method analyzed in Ref  \cite{Tyagi15}  In Sec  \ref{sec:conc}, we outline conclusive remarks and perspectives 

        \section{The leading $XY$ model}
      \label{sec:model}
 The leading model we are considering is defined, for a system of $N$ angular $XY$ variables, by the Hamiltonian 
 \begin{equation}
  \mathcal{H} = - \sum_{ik}^{1,N} J_{ik} \cos{\left(\phi_i-\phi_k\right)} 
  \label{eq:HXY}
 
  \end{equation} 
  
  The $XY$ model is well known in statistical mechanics, displaying important physical
  insights, starting from the Berezinskii-Kosterlitz-Thouless
  transition in two dimensions\cite{Berezinskii70,Berezinskii71,Kosterlitz72} and moving to, e g , the
  transition of liquid helium to its superfluid state \cite{Brezin82}, the roughening transition of the interface of a crystal in equilibrium with its vapor \cite{Cardy96}  In presence of disorder and frustration \cite{Villain77,Fradkin78} the model has been adopted to describe synchronization problems as the Kuramoto model \cite{Kuramoto75} and in the theoretical modeling of Josephson junction arrays \cite{Teitel83a,Teitel83b} and arrays of coupled lasers \cite{Nixon13} 
  Besides several derivations and implementations of the model in quantum and classical physics, equilibrium or out of equilibrium, ordered or fully frustrated systems, Eq  (\ref{eq:HXY}), in its generic form,
  has found applications also in other fields  A rather fascinating example being the behavior of starlings flocks  \cite{Reynolds87,Deneubourg89,Huth90,Vicsek95, Cavagna13} 
  Our interest on the $XY$ model resides, though, in optics  Phasor and phase models with pairwise and  multi-body interaction terms can, indeed, describe the behavior of electromagnetic modes in both linear and nonlinear optical systems in the analysis of problems such as light propagation and lasing \cite{Gordon02, Antenucci15c, Antenucci15d}  As couplings are strongly frustrated, these models turn out to be especially useful to the study of optical properties in random media \cite{Antenucci15a,Antenucci15b}, as in the noticeable case of random lasers \cite{Wiersma08,Andreasen11,Antenucci15e}  and they might as well be applied to linear scattering problems, e g , propagation of waves in opaque systems or disordered fibers  
  
  
  \subsection{A propagating wave model}
  We briefly mention a derivation of the model as a proxy for the propagation of light through random linear media  
 Scattering of light is held responsible to obstruct our view and make objects opaque  Light rays, once that they enter the material, only exit  after getting scattered multiple times within the material  In such a disordered medium, both the direction and the phase of the propagating waves are random  Transmitted light 
 yields a disordered interference pattern typically  having low intensity, random phase and almost no resolution, called a speckle  Nevertheless, in recent years it has been realized that disorder is rather a blessing in disguise \cite{Vellekoop07,Vellekoop08a,Vellekoop08b}  Several experiments have made it possible to control the behavior of light and other optical processes in a given random disordered medium,  
 by exploiting, e g ,  the tools developed for wavefront shaping to control the propagation of light and to engineer the confinement of light \cite{Yilmaz13,Riboli14} 
 \\
 \indent
 In a linear dielectric medium, light propagation can be described through a part of the scattering matrix, the transmission matrix $\mathbb{T}$, linking the outgoing to the incoming fields  
 Consider the case in which there are $N_I$ incoming channels and $N_O$ outgoing ones; we can indicate with $E^{\rm in,out}_k$ the input/output electromagnetic field phasors of channel $k$  In the most general case, i e , without making any particular assumptions on the field polarizations, each light mode and its polarization polarization state can be represented by means of the $4$-dimensional Stokes vector  Each $ t_{ki}$ element of $\mathbb{T}$, thus, is a $4 \times 4$ M{\"u}ller matrix  If, on the other hand, we know that the source is polarized and the observation is made on the same polarization, one can use a scalar model and adopt Jones calculus \cite{Goodman85,Popoff10a,Akbulut11}:
   \begin{eqnarray}
 E^{\rm out}_k = \sum_{i=1}^{N_I}  t_{ki} E^{\rm in}_i \qquad \forall~ k=1,\ldots,N_O
 \label{eq:transm}
 \end{eqnarray}
  We recall that the elements of the transmission matrix are random complex coefficients\cite{Popoff10a}  For the case of completely unpolarized modes, we can also use a scalar model similar to Eq  \eqref{eq:transm}, but whose variables are  the intensities of the outgoing/incoming fields, rather than the fields themselves \\ 
In the following, for simplicity, we will consider Eq  (\ref{eq:transm}) as our starting point,
where $E^{\rm out}_k$, $E^{\rm in}_i$ and $t_{ki}$ are all complex scalars  
If Eq  \eqref{eq:transm} holds for any $k$, we can write:
  \begin{eqnarray}
  \int \prod_{k=1}^{N_O} dE^{\rm out}_k \prod_{k=1}^{N_O}\delta\left(E^{\rm out}_k - \sum_{j=1}^{N_I}  t_{kj} E^{\rm in}_j \right) = 1
  \nonumber
  \\
  \label{eq:deltas}
  \end{eqnarray}

 Observed data are a noisy representation of the true values of the fields  Therefore, in inference problems it is statistically more meaningful to take that noise into account in a probabilistic way, 
 rather than looking  at the precise solutions of the exact equations (whose parameters are unknown)  
 To this aim we can introduce Gaussian distributions whose limit for zero variance are the Dirac deltas in Eq  (\ref{eq:deltas}) 
 Moreover, we move to consider the ensemble of all possible solutions of Eq  (\ref{eq:transm}) at given $\mathbb{T}$, looking at  all configurations of input fields  We, thus, define the function:
 
   \begin{eqnarray}
  Z &\equiv &\int_{{\cal S}_{\rm in}} \prod_{j=1}^{N_I}  dE^{\rm in}_j \int_{{\cal S}_{\rm out}}\prod_{k=1}^{N_O} dE^{\rm out}_k 
  \label{def:Z}
\\
    \times
  &&\prod_{k=1}^{N_O}
   \frac{1}{\sqrt{2\pi \Delta^2}}  \exp\left\{-\frac{1}{2 \Delta^2}\left|
  E^{\rm out}_k -\sum_{j=1}^{N_I}  t_{kj} E^{\rm in}_j\right|^2
\right\} 
\nonumber
 \end{eqnarray}
   We stress that the integral of Eq  \eqref{def:Z} is not exactly a Gaussian integral  Indeed, starting from Eq  \eqref{eq:deltas}, two constraints on the electromagnetic field intensities must be taken into account  

  The space of solutions is  delimited by the total power ${\cal P}$ received by system, i e , 
  ${\cal S}_{\rm in}: \{E^{\rm in} |\sum_k I^{\rm in}_k = \mathcal{P}\}$, also implying  a constraint on the total amount of energy that is transmitted through the medium, i  e , 
  ${\cal S}_{\rm out}:\{E^{\rm out} |\sum_k I^{\rm out}_k=c\mathcal{P}\}$, where the attenuation factor  $c<1$ accounts for total losses 
  As we will see more in details in the following, being interested in inferring the transmission matrix through the PLM, we can omit to explicitly include these terms in Eq  \eqref{eq:H_J} since they do not depend on $\mathbb{T}$ not adding any information on the gradients with respect to the elements of $\mathbb{T}$ 
  
 Taking the same number of incoming and outcoming channels, $N_I=N_O=N/2$, and  ordering the input fields in the first $N/2$ mode indices and the output fields in the last $N/2$ indices, we can drop the ``in'' and ``out'' superscripts and formally write $Z$  as a partition function
    \begin{eqnarray}
        \label{eq:z}
 && Z =\int_{\mathcal S} \prod_{j=1}^{N} dE_j \left(   \frac{1}{\sqrt{2\pi \Delta^2}} \right)^{N/2} 
 \hspace*{- 4cm} \exp\left\{
  -\frac{ {\cal H} [\{E\};\mathbb{T}] }{2\Delta^2}
  \right\}
  \\
&&{\cal H} [\{E\};\mathbb{T}] =
-  \sum_{k=1}^{N/2}\sum_{j=N/2+1}^{N} \left[E^*_j t_{jk} E_k + E_j t^*_{kj} E_k^* 
\right]
 \nonumber
\\
&&\qquad\qquad \qquad + \sum_{j=N/2+1}^{N} |E_j|^2+ \sum_{k,l}^{1,N/2}E_k
U_{kl} E_l^*
 \nonumber
 \\
 \label{eq:H_J}
 &&\hspace*{1 88cm } = - \sum_{nm}^{1,N} E_n J_{nm} E_m^*
 \end{eqnarray}
 where ${\cal H}$ is a real-valued function by construction, we have introduced the effective input-input coupling matrix
\begin{equation}
U_{kl} \equiv \sum_{j=N/2+1}^{N}t^*_{lj} t_{jk} 
 \label{def:U}
 \end{equation}
 and the whole interaction matrix reads (here $\mathbb{T} \equiv \{ t_{jk} \}$)
 \begin{equation}
 \label{def:J}
 \mathbb J\equiv \left(\begin{array}{ccc|ccc}
 \phantom{()}&\phantom{()}&\phantom{()}&\phantom{()}&\phantom{()}&\phantom{()}\\
 \phantom{()}&-\mathbb{U} \phantom{()}&\phantom{()}&\phantom{()}&{\mathbb{T}}&\phantom{()}\\
\phantom{()}&\phantom{()}&\phantom{()}&\phantom{()}&\phantom{()}&\phantom{()}\\
 \hline
\phantom{()}&\phantom{()}&\phantom{()}&\phantom{()}&\phantom{()}&\phantom{()}\\
 \phantom{()}& \mathbb   T^\dagger&\phantom{()}&\phantom{()}& - \mathbb{I} &\phantom{()}\\
\phantom{a}&\phantom{a}&\phantom{a}&\phantom{a}&\phantom{a}&\phantom{a}\\
 \end{array}\right)
 \end{equation}
 
 Determining the electromagnetic complex amplitude configurations that minimize the {\em cost function} ${\cal H}$, Eq   (\ref{eq:H_J}),  means to maximize the overall distribution peaked around the solutions of the transmission Eqs  (\ref{eq:transm})  As the variance $\Delta^2\to 0$, eventually, the initial set of Eqs  (\ref{eq:transm}) are recovered  The ${\cal H}$ function, thus, plays the role of an Hamiltonian and  $\Delta^2$ the role of a noise-inducing temperature  The exact numerical problem corresponds to the zero temperature limit of the statistical mechanical problem  Working with real data, though, which are noisy, a finite ``temperature''
  allows for a better representation of the ensemble of solutions to the sets of equations of continuous variables  
  

  
  
  Now, we can express every phasor in Eq  \eqref{eq:z}  as $E_k = A_k e^{\imath \phi_k}$  As a working hypothesis we will consider the intensities $A_k^2$ as either homogeneous or as \textit{quenched} with respect to phases 
The first condition occurs, for instance, to the input intensities $|E^{\rm in}_k|$ produced by a phase-only spatial light modulator (SLM) with homogeneous illumination \cite{Popoff11} 
With \textit{quenched} here we mean, instead, that the intensity of each mode is the same for every solution of Eq  \eqref{eq:transm} at fixed $\mathbb T$ 
We stress that, including intensities in the model does not preclude the inference analysis but it is out of the focus of the present work and will be considered elsewhere  

If all intensities are uniform in input and in output, this amount to a constant rescaling for each one of the four sectors of matrix $\mathbb J$ in Eq  (\ref{def:J}) that will not change the properties of the matrices 
For instance, if the original transmission matrix is unitary, so it will be the rescaled one and the matrix $\mathbb U$ will be  diagonal 
Otherwise, if intensities are \textit{quenched}, i e , they can be considered as constants in Eq  (\ref{eq:transm}),
they are inhomogeneous with respect to phases  The generic Hamiltonian element will, therefore, rescale as 
  \begin{eqnarray}
  E^*_n J_{nm} E_m = J_{nm} A_n A_m e^{\imath (\phi_n-\phi_m)} \to J_{nm} e^{\imath (\phi_n-\phi_m)}
  \nonumber
  \end{eqnarray}
  and the properties of the original  $J_{nm}$ components are not conserved  in the rescaled one  In particular, we have no argument, anymore, to possibly set the rescaled $U_{nm}\propto \delta_{nm}$ 
  Eventually, we end up with the complex couplings $XY$ model, whose real-valued Hamiltonian is written as
 \begin{eqnarray}
  \mathcal{H}& = &  - \frac{1}{2} \sum_{nm} J_{nm} e^{-\imath (\phi_n - \phi_m)}  + \mbox{c c } 
    \label{eq:h_im}
\\    &=&  - \frac{1}{2} \sum_{nm} \left[J^R_{nm} \cos(\phi_n - \phi_m)+
  J^I_{nm}\sin (\phi_n - \phi_m)\right] 
  \nonumber
 \end{eqnarray}
where $J_{nm}^R$ and $J_{nm}^I$ are the real and imaginary parts of $J_{nm}$  Being $\mathbb J$  Hermitian, $J^R_{nm}=J^R_{mn}$ is symmetric and $J_{nm}^I=-J_{mn}^I$ is skew-symmetric 

\begin{comment}
\textcolor{red}{
F: comment about quenched:
I think that to obtain the XY model, it is not necessary that the intensities are strictly quenched (that is also a quite unfeasible situation, I guess) 
Indeed eq (2) does not deal with the dynamics of the modes, but just connect the in and out ones 
For this, what it is necessary to have the XY model, it is that the intensities are always the same on the different samples
(so that the matrix $t_{ij}$ is the same for different phase data)  If the intensities are fixed, then they can be incorporated in $t_{ij}$ and eq (2) can be written just for phases as described  \\
}
\end{comment}


  \section{Pseudolikelihood Maximization}
  \label{sec:plm}
The inverse problem consists in the reconstruction of the parameters $J_{nm}$ of the Hamiltonian, Eq  (\ref{eq:h_im})   
Given a set of $M$ data configurations of $N$ spins
 $\bm\sigma = \{ \cos \phi_i^{(\mu)},\sin \phi_i^{(\mu)} \}$, $i = 1,\dots,N$ and $\mu=1,\dots,M$, we want to \emph{infer} the couplings:
 \begin{eqnarray}
\bm \sigma  \rightarrow  \mathbb{J} 
\nonumber
 \end{eqnarray}
 With this purpose in mind,
 in the rest of this section we implement the working equations for the techniques used  
 In order to test our methods, we generate the input data, i e , the configurations, by Monte-Carlo simulations of the model 
 The joint probability distribution of the $N$ variables $\bm{\phi}\equiv\{\phi_1,\dots,\phi_N\}$, follows the Gibbs-Boltzmann distribution:
 \begin{equation}\label{eq:p_xy}
 P(\bm{\phi}) = \frac{1}{Z} e^{-\beta \mathcal{H\left(\bm{\phi}\right)}} \quad \mbox{ where } \quad Z = \int \prod_{k=1}^N d\phi_k  e^{-\beta \mathcal{H\left(\bm{\phi}\right)}}  
 \end{equation}
 and where we denote $\beta=\left( 2\Delta^2 \right)^{-1}$ with respect to Eq  (\ref{def:Z}) formalism 
 In order to stick to usual statistical inference notation, in the following we will rescale the couplings by a factor $\beta / 2$: $\beta J_{ij}/2 \rightarrow J_{ij}$  
 The main idea of the PLM is to work with the conditional probability distribution of one variable $\phi_i$ given all other variables, 
 $\bm{\phi}_{\backslash i}$:
 
  \begin{eqnarray}
	\nonumber
   P(\phi_i | \bm{\phi}_{\backslash i}) &=& \frac{1}{Z_i} \exp \left \{ {H_i^x (\bm{\phi}_{\backslash i})
  	\cos \phi_i + H_i^y (\bm{\phi}_{\backslash i}) \sin \phi_i } \right \}
	\\
 \label{eq:marginal_xy}
	&=&\frac{e^{H_i(\bm{\phi}_{\backslash i}) \cos{\left(\phi_i-\alpha_i(\bm{\phi}_{\backslash i})\right)}}}{2 \pi I_0(H_i)}
  \end{eqnarray}
  where $H_i^x$ and $H_i^y$ are defined as
   \begin{eqnarray}
   H_i^x (\bm{\phi}_{\backslash i})  &=& \sum_{j (\neq i)} J^R_{ij} \cos \phi_j  - \sum_{j  (\neq i) } J_{ij}^{I} \sin \phi_j \phantom{+  h^R_i} \label{eq:26} \\
   H_i^y  (\bm{\phi}_{\backslash i})  &=&  \sum_{j  (\neq i)} J^R_{ij}  \sin \phi_j  + \sum_{j  (\neq i) } J_{ij}^{I}   \cos \phi_j \phantom{ + h_i^{I} }\label{eq:27}
   \end{eqnarray}
and $H_i= \sqrt{(H_i^x)^2 + (H_i^y)^2}$, $\alpha_i = \arctan H_i^y/H_i^x$   and we introduced the modified Bessel function of the first kind:
  \begin{equation}
  \nonumber
   I_k(x) = \frac{1}{2 \pi}\int_{0}^{2 \pi} d \phi e^{x \cos{ \phi}}\cos{k \phi}
  \end{equation}
  
   Given $M$ observation samples $\bm{\phi}^{(\mu)}=\{\phi^\mu_1,\ldots,\phi^\mu_N\}$, $\mu = 1,\dots, M$, the
   pseudo-loglikelihood for the variable $i$ is given by the logarithm of Eq  (\ref{eq:marginal_xy}),
   \begin{eqnarray}
   \label{eq:L_i}
   L_i &=& \frac{1}{M}  \sum_{\mu = 1}^M  \ln P(\phi_i^{(\mu)}|\bm{\phi}^{(\mu)}_{\backslash i})
   \\
   \nonumber
   & =&  \frac{1}{M}  \sum_{\mu = 1}^M  \left[ H_i^{(\mu)} \cos( \phi_i^{(\mu)} - \alpha_i^{(\mu)}) - \ln  2 \pi I_0\left(H_i^{(\mu)}\right)\right] \,  
    \end{eqnarray}
The underlying idea of PLM is that an approximation of the true parameters of the model is obtained for values that maximize the functions $L_i$ 
The specific maximization scheme differentiates the different techniques 


   
   
   \subsection{PLM with $l_2$ regularization}
   Especially for the case of sparse graphs, it is useful to add a regularizer, which prevents the maximization routine to move towards high values of 
   $J_{ij}$ and $h_i$ without converging  We will adopt an $l_2$ regularization so that the Pseudolikelihood function (PLF) at site $i$  reads:
   \begin{equation}\label{eq:plf_i}
  {\cal L}_i = L_i
  - \lambda \sum_{i \neq j} \left(J_{ij}^R\right)^2 - \lambda \sum_{i \neq j} \left(J_{ij}^I\right)^2  
   \end{equation}
   with $\lambda>0$ 
   Note that the values of $\lambda$ have to be chosen arbitrarily, but not too large, in order not to overcome $L_i$ 
   The standard implementation of the PLM consists in maximizing each ${\cal L}_i$, for $i=1\dots N$, separately  The expected values of the couplings are then:
   \begin{equation}
   \{ J_{i j}^*\}_{j\in \partial i} :=  \mbox{arg max}_{ \{ J_{ij} \}}
    \left[{\cal L}_i\right]
   \end{equation}
   In this way, we obtain two estimates for the coupling $J_{ij}$, one from maximization of ${\cal L}_i$, $J_{ij}^{(i)}$, and another one from ${\cal L}_j$, say $J_{ij}^{(j)}$ 
    Since the original Hamiltonian of the $XY$ model is Hermitian, we know that the real part of the couplings is symmetric while the imaginary part is skew-symmetric  
   
     The final estimate for $J_{ij}$ can then be obtained  averaging the two results:
  
  
  
   \begin{equation}\label{eq:symm}
   J_{ij}^{\rm inferred} = \frac{J_{ij}^{(i)} + \bar{J}_{ij}^{(j)}}{2} 
   \end{equation}
   where with $\bar{J}$ we indicate the complex conjugate 
   It is worth noting that the pseudolikelihood $L_i$, Eq  \eqref{eq:L_i}, is characterized by the
   following properties: (i) the normalization term of Eq \eqref{eq:marginal_xy} can be
   computed analytically at odd with the {\em full} likelihood case that
   in general require a computational time which scales exponentially
   with the size of the systems; (ii) the $\ell_2$-regularized pseudolikelihood
   defined in Eq \eqref{eq:plf_i} is strictly concave (i e  it has a single
   maximizer)\cite{Ravikumar10}; (iii) it is consistent, i e  if $M$ samples are
   generated by a model $P(\phi | J*)$ the maximizer tends to $J*$
   for $M\rightarrow\infty$\cite{besag1975}  Note also that (iii) guarantees that  
   $|J^{(i)}_{ij}-J^{(j)}_{ij}| \rightarrow 0$ for $M\rightarrow \infty$ 
   In Secs  \ref{sec:res_reg}, \ref{sec:res_dec} 
   we report the results obtained and we analyze the performances of the PLM having taken the configurations from Monte-Carlo simulations of models whose details are known 
   

   
   \subsection{PLM with decimation}
   Even though the PLM with $l_2$-regularization allows to dwell the inference towards the low temperature region and in the low sampling case with better performances that mean-field methods, in some situations some couplings are overestimated and not at all symmetric  Moreover, in the technique there is the bias of the $l_2$ regularizer 
   Trying to overcome these problems, Decelle and Ricci-Tersenghi introduced a new method \cite{Decelle14}, known as PLM + decimation: the algorithm maximizes the sum of the $L_i$,
   \begin{eqnarray}
    {\cal L}\equiv \frac{1}{N}\sum_{i=1}^N \mbox{L}_i
    \end{eqnarray}  
    and, then, it recursively set to zero couplings which are estimated very small  We expect that as long as we are setting to zero couplings that are unnecessary to fit the data, there should be not much changing on ${\cal L}$  Keeping on with decimation, a point is reached where ${\cal L}$ decreases abruptly indicating  that relevant couplings are being decimated and under-fitting is taking place 
   Let us define  by $x$  the fraction of non-decimated couplings  To have a quantitative measure for the halt criterion of the decimation process, a tilted ${\cal L}$ is defined as,
   \begin{eqnarray}
  \mathcal{L}_t &\equiv& \mathcal{L}  - x \mathcal{L}_{\textup{max}} - (1-x) \mathcal{L}_{\textup{min}} \label{$t$PLF} 
   \end{eqnarray}
   where 
   \begin{itemize}
   \item $\mathcal{L}_{\textup{min}}$ is the pseudolikelyhood of a model with independent variables  In the XY case: $\mathcal{L}_{\textup{min}}=-\ln{2 \pi}$ 
   \item
   $\mathcal{L}_{\textup{max}}$ is the pseudolikelyhood in the fully-connected model and it is maximized over all the $N(N-1)/2$ possible couplings  
   \end{itemize}
   At the first step, when $x=1$, $\mathcal{L}$ takes value $\mathcal{L}_{\rm max}$ and  $\mathcal{L}_t=0$  On the last step, for an empty graph, i e , $x=0$, $\mathcal{L}$ takes the value $\mathcal{L}_{\rm min}$ and, hence, again $\mathcal{L}_t =0$  
   In the intermediate steps, during the decimation procedure, as $x$ is decreasing from $1$ to $0$, one observes firstly that $\mathcal{L}_t$ increases linearly and, then, it displays an abrupt decrease indicating that from this point on relevant couplings are being decimated\cite{Decelle14}  In Fig  \ref{Jor1-$t$PLF} we give an instance of this behavior for the 2D short-range XY model with ordered couplings  We notice that the maximum point of $\mathcal{L}_t$ coincides with the minimum point of the reconstruction error, the latter defined as 
   \begin{eqnarray}\label{eq:errj}
   \mbox{err}_J \equiv \sqrt{\frac{\sum_{i<j} (J^{\rm inferred}_{ij} -J^{\rm true}_{ij})^2}{N(N-1)/2}} \label{err}
   \end{eqnarray}
  We stress that the ${\cal L}_t$ maximum is obtained ignoring the underlying graph, while the err$_J$ minimum can be evaluated once the true graph has been reconstructed  
   
     \begin{figure}[t!]
   	\centering
   	\includegraphics[width=1\linewidth]{Jor1_dec_tPLF_new eps}
   	\caption{The tilted likelyhood ${\cal L}_t$ curve and the reconstruction error vs the number of decimated couplings  for an ordered, real-valued J on 2D XY model with $N=64$ spins  The peak of ${\cal L}_t$ coincides with the dip of the error }  
   	\label{Jor1-$t$PLF}
   \end{figure} 
       
   
   In the next sections we will show the results obtained on the  $XY$ model analyzing the performances of the two methods and comparing them also with a mean-field method \cite{Tyagi15} 
   
  
    
   \section{Inferred couplings with PLM-$l_2$}
    \label{sec:res_reg}
    \subsection{$XY$ model with real-valued couplings}
    
    In order to obtain the vector of couplings, $J_{ij}^{\rm inferred}$ the function $-\mathcal{L}_i$ is minimized through the vector of derivatives ${\partial \mathcal{L}_i}/\partial J_{ij}$  The process is repeated for all the couplings obtaining then a fully connected adjacency matrix  The results here presented are obtained with $\lambda = 0 01$ 
   For the minimization we have used the MATLAB routine \emph{minFunc\_2012}\cite{min_func}  
      
      \begin{figure}[t!]
    	\centering
    	\includegraphics[width=1\linewidth]{Jor11_2D_l2_JR_soJR_TPJR}
    	\caption{Top panels: instances of single site coupling reconstruction for the case of $N=64$ XY spins on a 2D lattice with ordered $J$ (left column) and bimodal distributed $J$ (right column)  
    	
    	Bottom panels: sorted couplings }
    	\label{PL-Jor1}
    \end{figure}

   
To produce the data by means of numerical Monte Carlo simulations a system with $N=64$  spin variables  is considered on a deterministic 2D lattice with periodic boundary conditions  
Each spin has then connectivity $4$, i e , we expect to infer an adjacency matrix with $N c = 256$ couplings different from zero  
The dynamics of the simulated model is based on the Metropolis algorithm and parallel tempering\cite{earl05} is used to speed up the thermalization of the system 
The thermalization is tested looking at the average energy over logarithmic time windows and
the acquisition of independent configurations
starts only after the system is well thermalized 

   For the values of the couplings we considered two cases: an ordered case, indicated in the figure as  $J$ ordered (e g , left column of Fig  \ref{PL-Jor1}) where the couplings can take values $J_{ij}=0,J$, with $J=1$, 
   and a quenched disordered case, indicated in the figures as  $J$ disordered (e g , right column of Fig  \ref{PL-Jor1})
   where the couplings can take also  negative values, i e , 
    $J_{ij}=0,J,-J$, with a certain probability   The results here presented were obtained with bimodal distributed $J$s: 
   
    $P(J_{ij}=J)=P(J_{ij}=-J)=1/2$   The performances of the PLM have shown not to depend on $P(J)$  
   
    We recall that in Sec  \ref{sec:plm} we used the temperature-rescaled notation, i e , $J_{ij}$ stands for $J_{ij}/T$  
   
    To analyze the performances of the PLM, in Fig  \ref{PL-Jor1} the inferred couplings, $\mathbb{J}^R_{\rm inf}$, are shown on top of the original couplings,  $\mathbb{J}^R_{\rm true}$ 
     The first figure (from top) in the left column shows  the $\mathbb{J}^R_{\rm inf}$ (black) and the $\mathbb{J}^R_{\rm tru}$ (green) for a given spin
     at temperature $T/J=0 7$ and number of samples  $M=1024$  PLM appears to reconstruct the correct couplings, though zero couplings are always given a small inferred non-zero value  
     In the left column of Fig   \ref{PL-Jor1},  both the $\mathbb{J}^R_{\rm{inf}}$ and the $\mathbb{J}^R_{\rm{tru}}$ are sorted in decreasing order and plotted on top of each other  
     We can clearly see that $\mathbb{J}^R_{\rm inf}$ reproduces the expected step function  Even though the jump is smeared, the difference between inferred couplings corresponding to the set of non-zero couplings 
     and to the set of zero couplings can be clearly appreciated 
     Similarly, the plots in the right column of Fig  \ref{PL-Jor1} show the results obtained for the case with  bimodal disordered couplings, for the same working temperature and number of samples  
     In particular, note that the algorithm infers half positive and half negative couplings, as expected 
     
     
\begin{figure}
\centering
\includegraphics[width=1\linewidth]{Jor11_2D_l2_errJ_varT_varM}
\caption{Reconstruction error $\mbox{err}_J$, cf  Eq  (\ref{eq:errj}), plotted as a function of temperature (left) for three values of the number of samples $M$ and  as a function $M$ (right) for three values of temperature in the ordered system, i e , $J_{ij}=0,1$  
The system size is $N=64$ }
\label{PL-err-Jor1}
\end{figure}

In order to analyze the effects of the number of samples and of the temperature regimes, we plot in Fig  \ref{PL-err-Jor1} the reconstruction error, Eq  (\ref{err}), as a function of temperature for three different sample sizes $M=64,128$ and $512$  
The error is seen to sharply rise al low temperature, incidentally, in the ordered case, for  $T<T_c \sim 0 893$, which is the Kosterlitz-Thouless transition temperature of the 2XY model\cite{Olsson92}  
 However, we can see that if only $M=64$ samples are considered, $\mbox{err}_J$ remains high independently on the working temperature  
 In the right plot of Fig  \ref{PL-err-Jor1},  $\mbox{err}_J$ is plotted as a function of $M$ for three different working temperatures $T/J=0 4,0 7$ and $1 3$  As we expect, 
 $\mbox{err}_J$  decreases as $M$ increases  This effect was observed also with mean-field inference techniques on the same model\cite{Tyagi15} 

To better understand the performances of the algorithms, in Fig  \ref{PL-varTP-Jor1} we show several True Positive (TP) curves obtained for various values of $M$ at three different temperatures $T$  As $M$ is large and/or temperature is not too small,  we are able to reconstruct correctly all the couplings present in the system (see bottom plots) 
The True Positive curve displays how many times the inference method finds a true link of the original network  as a function of the index of the vector of sorted absolute value of reconstructed couplings $J_{ij}^{\rm inf}$  
The index $n_{(ij)}$ represents the related spin couples $(ij)$  The TP curve is obtained as follows: 
first  the values $|J^{\rm inf}_{ij}|$ are sorted in descending order and  the spin pairs $(ij)$ are ordered according to the sorting position of $|J^{\rm inf}_{ij}|$  Then,
     	a cycle over the ordered set of pairs $(ij)$, indexed by $n_{(ij)}$, is performed, comparing with the original network coupling $J^{\rm true}_{ij}$ and verifying whether it is zero or not  The true positive curve is computed as
\begin{equation}
\mbox{TP}[n_{(ij)}]= \frac{\mbox{TP}\left[n_{(ij)}-1\right] (n_{ij}-1)+ 1 -\delta_{J^{\rm true}_{ij},0}}{n_{(ij)}}
\end{equation}
As far as $J^{\rm true}_{ij} \neq 0$, TP$=1$  As soon as the true coupling of a given $(ij)$ couple in the sorted list is zero, the TP curve departs from one  
In our case, where the connectivity per spin of the original system is  $c=4$ and there are $N=64$ spins, we know that we will have  $256$ non-zero couplings   
     	If the inverse problem is successful, hence, we expect a steep decrease of the TP curve when  $n_{ij}=256$ is overcome 

In Fig  \ref{PL-varTP-Jor1}
it is  shown that,  almost independently of $T/J$, the TP score improves as $M$ increases  Results are plotted for three different temperatures, $T=0 4,1$ and $2 2$, with increasing number of samples $M = 64, 128,512$ and $1024$ (clockwise)  
We can clearly appreciate the improvement in temperature if the size of the data-set is not very large: for small $M$, $T=0 4$ performs better  
When $M$ is high enough (e g , $M=1024$), instead, the TP curves do not appear to be strongly influenced by the temperature 

\begin{figure}[t!]
	\centering
	\includegraphics[width=1\linewidth]{Jor11_2D_l2_TPJR_varT_varM}
	\caption{TP  curves  for 2D short-range ordered $XY$ model with $N=64$ spins at three different values of $T/J$ with increasing - clockwise from top - $M$ }
	\label{PL-varTP-Jor1} 
\end{figure} 

\subsection{$XY$ model with complex-valued couplings}
For the complex $XY$ we have to contemporary  infer $2$ apart coupling matrices,  $J^R_{i j}$ and $J^I_{i j}$   As before, a system of $N=64$ spins is considered on a 2D lattice 
For the couplings we have considered both ordered and bimodal disordered cases 
In Fig  \ref{PL-Jor3}, a single row of the matrix $J$ (top) and the whole sorted couplings (bottom) are displayed for the ordered model (same legend as in Fig  \ref{PL-Jor1}) for the real, $J^R$ (left column), and the imaginary part, $J^I$   

\begin{figure}[t!]
	\centering
\includegraphics[width=1\linewidth]{Jor3_l2_JRJI_soJRJI_TPJRJI}
	\caption{Results related to the ordered complex XY model with $N=64$ spins on a  2D lattice  Top: instances of  single site reconstruction for the real, JR (left column), and
		the imaginary, JI (right column), part of $J_{ij}$  Bottom: sorted values of JR (left) and JI (right) }
		
	\label{PL-Jor3}
\end{figure}
 
 
  \section{PLM with Decimation}
 \label{sec:res_dec}
 

\begin{figure}[t!]
   	\centering
   	\includegraphics[width=1\linewidth]{Jor1_dec_tPLF_varT_varM}
    	\caption{Tilted Pseudolikelyhood, ${\cal L}_t$, plotted as a function of decimated couplings  Top: Different ${\cal L}_t$ curves obtained for different values of $M$ plotted on top of each other  Here $T=1 3$  The black line indicates the expected number of decimated couplings, $x^*=(N (N-1) - N c)/2=1888$  As we can see, as $M$ increases, the maximum point of ${\cal L}_t$ approaches $x^*$  Bottom: Different ${\cal L}_t$ curves obtained for different values of T with $M=2048$  We can see that, with this value of $M$, no differences can be appreciated on the maximum points of the different  ${\cal L}_t$ curves }
   	\label{var-$t$PLF}
   \end{figure}

\begin{figure}[t!]
    \centering
    \includegraphics[width=1\linewidth]{Jor1_dec_tPLF_peak_statistics_varM_prob eps}
    	\caption{Number of most likely decimated couplings, estimated by the maximum point of $\mathcal{L}_t$, as a function of the number of samples $M$  We can clearly see that the maximum point of $\mathcal{L}_t$ tends toward $x^*$, which is the right expected number of zero couplings in the system }  
    	\label{PLF_peak_statistics}
    \end{figure}
      
      For the ordered real-valued XY model we show in Fig  \ref{var-$t$PLF}, top panel, the outcome on the tilted pseudolikelyhood, $\mathcal{L}_t$ Eq  \eqref{$t$PLF}, of the progressive decimation: from a fully connected lattice  down to an empty lattice  The figure shows the behaviour of $\mathcal{L}_t$ for three different data sizes $M$  A clear data size dependence of the maximum point of  $\mathcal{L}_t$, signalling the most likely value for decimation, is shown  For small $M$ the most likely number of  couplings is overestimated and for increasing $M$ it tends to the true value, as displayed in Fig  \ref{PLF_peak_statistics}   In the bottom panel of Fig  \ref{var-$t$PLF} we display instead different 
 $\mathcal{L}_t$ curves obtained for three different values of $T$ 
  Even though the values of $\mathcal{L}_t$ decrease with increasing temperature, the value of the most likely number of decimated couplings appears to be quite independent on $T$ with $M=2048$ number of samples 
In Fig  \ref{fig:Lt_complex} we eventually display the tilted pseudolikelyhood for a 2D network with complex valued ordered couplings, where the decimation of the real and imaginary coupling matrices proceeds in parallel, that is, 
when a real coupling is small enough to be decimated its imaginary part is also decimated, and vice versa 
One can see that though the apart errors for the real and imaginary parts are different in absolute values, they display the same dip, to be compared with the maximum point of $\mathcal{L}_t$ 
     
       \begin{figure}[t!]
    	\centering
      	\includegraphics[width=1\linewidth]{Jor3_dec_tPLF_new}
      	\caption{Tilted Pseudolikelyhood, ${\cal L}_t$, plotted with the reconstruction errors for the XY model with $N=64$ spins on a 2D lattice  These results refer to the case of  ordered and complex valued couplings  The full (red) line indicates ${\cal L}_t$  The dashed (green) 
      		and the dotted (blue) lines show the reconstruction errors (Eq  \eqref{eq:errj}) obtained for the real and the imaginary couplings respectively  We can see that both ${\rm err_{JR}}$ and ${\rm err_{JI}}$ have a minimum at $x^*$ }
          	\label{fig:Lt_complex}
    \end{figure}

\begin{figure}[t!]
   	\centering
   	\includegraphics[width=1\linewidth]{Jor1_dec_JR_soJR_TPJR}
   	\caption{XY model on a 2D lattice with $N=64$ sites and real valued couplings  The graphs show the inferred (dashed black lines) and true couplings (full green lines) plotted on top of each other  The left and right columns refer to the
   		 cases of ordered and bimodal disordered couplings, respectively  Top figures: single site reconstruction, i e , one row of the matrix $J$  Bottom figures: couplings are plotted sorted in descending order }  
   	\label{Jor1_dec}
   \end{figure}
   
\begin{figure}[t!]
    	\centering
    	\includegraphics[width=1\linewidth]{Jor3_dec_JRJI_soJRJI_TPJRJI}
    	\caption{XY model on a 2D lattice with $N=64$ sites and ordered complex-valued couplings 
    		The inferred and true couplings are plotted on top of each other  The left and right columns show the real and imaginary parts, respectively, of the couplings  Top figures refer to a single site reconstruction, i e , one row of the matrix $J$  Bottom figures report the couplings sorted in descending order }
    	\label{Jor3_dec}
    \end{figure}
    
       







       \begin{figure}[t!]
     	\centering
     	\includegraphics[width=1\linewidth]{MF_PL_Jor1_2D_TPJR_varT}
     	\caption{True Positive curves obtained with the three techniques: PLM with decimation, (blue) dotted line,  PLM with $l_2$ regularization, (greed) dashed line, and mean-field, (red) full line   These results refer to real valued ordered couplings with $N=64$ spins on a 2D lattice  The temperature is here $T=0 7$ while the four graphs refer to different sample sizes: $M$ increases clockwise }
     	\label{MF_PL_TP}
     \end{figure}
    
    \begin{figure}[t!]
    	\centering
    	\includegraphics[width=1\linewidth]{MF_PL_Jor1_2D_errJ_varT_varM}
    	\caption{Variation of reconstruction error, ${\rm err_J}$, with respect to temperature as obtained with the three different techniques, see Fig  \ref{MF_PL_TP}, for four different sample size:  clockwise from top   $M=512,1024, 2048$ and $4096$ } 
    	\label{MF_PL_err}
    \end{figure}
    
     Once the most likely network has been identified through the decimation procedure, we perform the same analysis displayed in Fig  \ref{Jor1_dec}  for ordered and then quenched disordered real-valued couplings
and in Fig  \ref{Jor3_dec} for  complex-valued ordered couplings   In comparison to the results shown in Sec  \ref{sec:res_reg},
  the PLM with decimation leads to rather cleaner results  In Figs  \ref{MF_PL_err} and \ref{MF_PL_TP} we compare the performances of the PLM with decimation in respect to ones of the PLM with $l_2$-regularization  These two techniques are also analysed in respect to a mean-field technique previously implemented on the same XY systems\cite{Tyagi15} 
  
    For what concerns the network of connecting links, in Fig  \ref{MF_PL_TP} we compare the TP curves obtained with the three techniques  The results refer to the case of ordered and real valued couplings, but similar behaviours were obtained for the other cases analysed  
  The four graphs are related to different sample sizes, with $M$ increasing clockwise  When $M$ is high enough, all techniques reproduce the true network  
  However, for lower values of $M$ the performances of the PLM with $l_2$ regularization and with decimation drastically overcome those ones of the previous mean field technique  
  In particular, for $M=256$ the PLM techniques still reproduce the original network while the mean-field method fails to find more than half of the couplings  
  When $M=128$, the network is clearly reconstructed only through the PLM with decimation while the PLM with $l_2$ regularization underestimates the couplings  
  Furthermore, we notice that the PLM method with decimation is able to clearly infer the network of interaction even when $M=N$ signalling that it could be considered also in the under-sampling regime $M<N$   
 
 
In Fig  \ref{MF_PL_err} we compare the temperature behaviour of the reconstruction error 
In can be observed that for all temperatures and for all sample sizes  the reconstruction error, ${\rm err_J}$, (plotted here in log-scale) obtained with the PLM+decimation is always smaller than 
that one obtained with the other techniques  The temperature behaviour of ${\rm err_J}$ agrees with the one already observed for Ising spins in \cite{Nguyen12b} and for XY spins  in \cite{Tyagi15} with a mean-field approach:  ${\rm err_J}$ displays a minimum around $T\simeq 1$ and then it increases for very lower $T$; however,
 the error obtained with the PLM with decimation is several times smaller  than the error estimated by the other methods 



 
 

     
     \section{Conclusions}
     \label{sec:conc}


Different statistical inference methods have been applied to the inverse problem of the XY model 
After a short review of techniques based on pseudo-likelihood and their formal generalization to the model we have tested their performances against data generated by means of Monte Carlo numerical simulations of known instances
with diluted, sparse, interactions 

The main outcome is that the best performances are obtained by means of the  pseudo-likelihood method combined with decimation  Putting to zero (i e , decimating) very weak bonds, this technique turns out to be very precise for  problems whose real underlying interaction network is sparse, i e , the number of couplings per variable does not scale with number of variables 
The PLM + decimation method is compared to the PLM + regularization method, with $\ell_2$ regularization and to a mean-field-based method  The behavior of the quality of the network reconstruction is analyzed by looking at the overall sorted couplings and at the single site couplings, comparing them with the real network, and at the true positive curves in all three approaches  In the PLM +decimation method, moreover, the identification of the number of decimated bonds at which the tilted pseudo-likelihood is maximum allows for a precise estimate of the total number of bonds  Concerning this technique, it is also shown that the network with the most likely number of bonds is also the one of least reconstruction error, where not only the prediction of the presence of a bond is estimated but also its value 

The behavior of the inference quality in temperature and in the size of data samples is also investigated, basically confirming the low $T$ behavior hinted by Nguyen and Berg \cite{Nguyen12b} for the Ising model  In temperature, in particular, the reconstruction error curve displays a minimum at a low temperature, close to the critical point in those cases in which a critical behavior occurs, and a sharp increase as temperature goes to zero  The decimation method, once again, appears to enhance this minimum of the reconstruction error of almost an order of magnitude with respect to other methods 
 
The techniques displayed and the results obtained in this work can be of use in any of the many systems whose theoretical representation is given by Eq  \eqref{eq:HXY} or Eq  \eqref{eq:h_im}, some of which are recalled in Sec  \ref{sec:model}  In particular, a possible application can be the field of light waves propagation through random media and the corresponding problem of the  reconstruction of an object seen through an opaque medium or a disordered optical fiber \cite{Vellekoop07,Vellekoop08a,Vellekoop08b, Popoff10a,Akbulut11,Popoff11,Yilmaz13,Riboli14} 

 	
Context 2: McPherson County (standard abbreviation: MP) is a county located in the U S  state of Kansas   As of the 2020 census, the county population was 30,223  The largest city and county seat is McPherson  The county is named for Civil War General James B  McPherson 

History

Early history

For many millennia, the Great Plains of North America was inhabited by nomadic Native Americans  From the 16th century to 18th century, the Kingdom of France claimed ownership of large parts of North America  In 1762, after the French and Indian War, France secretly ceded New France to Spain, per the Treaty of Fontainebleau  In 1802, Spain returned most of the land to France, but keeping title to about 7,500 square miles 

In 1803, most of the land for modern day Kansas was acquired by the United States from France as part of the 828,000 square mile Louisiana Purchase for 2 83 cents per acre  In 1848, after the Mexican–American War, the Treaty of Guadalupe Hidalgo with Spain brought into the United States all or part of land for ten future states, including southwest Kansas  In 1854, the Kansas Territory was organized, then in 1861 Kansas became the 34th U S  state 

19th century

From the 1820s to 1870s, the Santa Fe Trail passed through, what is now McPherson County  The trail entered the county, east of Canton, then south of Galva, then north of Inman, and west towards Lyons  In 1855, Charles O  Fuller established a ranch adjacent to the Running Turkey Creek Crossing about two miles south and one mile east of Galva  Fuller's Ranch provided accommodations for travelers on the Santa Fe Trail and was probably the first white settlement in McPherson County 

Peketon County was established in 1860, by the passage of a bill by S  N  Wood:  An act to establish Peketon County  Section 1  - That all that territory west of the sixth principal meridian and south of Township 16, in Kansas Territory, be and the same is hereby erected into a county, to be known by the name of Peketon County  On February 17, 1865, Peketon County was abolished, and McPherson County was made a part of Marion County, which extended from the west line of Chase County to the present western boundary of Kansas 

In 1868, Solomon Stephens and L  N  Holmberg were appointed Justices of the Peace—the first officers in what is now McPherson County  The next year (1869) occurred the first election for the township, now the county of McPherson  McPherson was regularly organized as a county in the spring of 1870, a mass meeting being held at Sweadal  Sweadal, the county seat thus selected, was located about one mile and a half southwest of the present site of Lindsborg  In September, however, the County Commissioners resolved to meet at the latter place, McPherson which had already been located some two years 

In April, 1873, a petition was filed for the county seat re-location  It was signed by 483 voters, and a special election was accordingly ordered for June 10  Upon that day, McPherson received 605 votes, New Gottland 325, King City 3 and Lindsborg 1; McPherson's majority over all, 276  In May the McPherson Town Company had offered, as an inducement for the location of the county seat at this point, the free use of rooms for ten years, and the donation of two squares of land on the town site  The offer was accepted the next month, the County Commissioners selecting blocks 56 and 65  Thus the county seat was established at McPherson and has remained since 

As early as 1875, city leaders of Marion held a meeting to consider a branch railroad from Florence  In 1878, Atchison, Topeka and Santa Fe Railway and parties from Marion County and McPherson County chartered the Marion and McPherson Railway Company   In 1879, a branch line was built from Florence to McPherson, in 1880 it was extended to Lyons, in 1881 it was extended to Ellinwood  The line was leased and operated by the Atchison, Topeka and Santa Fe Railway  The line from Florence to Marion, was abandoned in 1968  In 1992, the line from Marion to McPherson was sold to Central Kansas Railway  In 1993, after heavy flood damage, the line from Marion to McPherson was abandoned  The original branch line connected Florence, Marion, Canada, Hillsboro, Lehigh, Canton, Galva, McPherson, Conway, Windom, Little River, Mitchell, Lyons, Chase, then connected with the original AT&SF main line at Ellinwood 

In 1887, the Chicago, Kansas and Nebraska Railway extended its main line from Herington to Pratt   This main line connected Herington, Ramona, Tampa, Durham, Waldeck, Canton, Galva, McPherson, Groveland, Inman, Medora, Hutchinson, Whiteside, Partridge, Arlington,  Langdon, Turon, Preston, Natrona, Pratt   In 1888, this main line was extended to Liberal   Later, this line was extended to Tucumcari, New Mexico and Santa Rosa, New Mexico, where it made a connection with the Southern Pacific from El Paso, Texas   The Chicago, Kansas and Nebraska Railway was absorbed by the Chicago, Rock Island and Pacific Railway  This line is also called the "Golden State Route" 

20th century
The National Old Trails Road, also known as the Ocean-to-Ocean Highway, was established in 1912, and was routed through Windom, Conway, McPherson 

Geography

According to the U S  Census Bureau, the county has a total area of , of which  is land and  (0 3%) is water 

Adjacent counties
 Saline County (north)
 Dickinson County (northeast)
 Marion County (east)
 Harvey County (southeast)
 Reno County (southwest)
 Rice County (west)
 Ellsworth County (northwest)

Major highways
  Interstate 135
  U S  Route 56
  U S  Route 81
  K-4
  K-61
  K-153

Demographics

The McPherson Micropolitan Statistical Area includes all of McPherson County 

2000 census
As of the census of 2000, there were 29,554 people, 11,205 households, and 7,966 families residing in the county   The population density was 33 people per square mile (13/km2)   There were 11,830 housing units at an average density of 13 per square mile (5/km2)   The racial makeup of the county was 96 53% White, 0 81% Black or African American, 0 34% Native American, 0
Context 3: Paper Info

Title: Incorporating Human Path Preferences in Robot Navigation with Minimal Interventions
Publish Date: 16 Mar 2023
Author List: Oriana Peltzer, Dylan Asmar, Mac Schwager, Mykel Kochenderfer

Figure

Hyperplane arrangement of a twodimensional space containing two obstacles (colored in gray) The robot is located inside the pink polytope, surrounded by three adjacent obstacle-free polytopes Each hyperplane on the boundary of the robot's polytope corresponds to one of the nonredundant constraints in eq (4) (b)Graph derived from the hyperplane arrangement The nodes on the graph designate polytopes, and edges designate transitions to adjacent polytopes To estimate the human's preference, the robot updates a posterior over the goal and over which of the graph transitions φ 1 , φ 2 and φ 3 is preferred by the human (c)Example preference defined over the graph The location of the goal is indicated in yellow in the lower right polytope For each node, the outgoing pink arrow designates the edge on the graph corresponding to the preferred transition between polytopes 
Simple, 10 × 10, 8 polytopes (b) Map 2: Office, 10 × 10, 56 polytopes (c) Map 3: Classroom, 20 × 20, 73 polytopes (d) Sampled observations and robot's executed trajectories 
Fig 5: Maps used for simulating the robot navigation problem with path preferences In (d), the heading angles observed are indicated with arrows The goal is indicated with a pink circle, and the orange robot corresponds to the starting location The blue robot follows a policy that accounts for path preference, while the green robot does not The opacity of the robots increases with time 
Map 1 problem setup and example realizations for goal-only (green) and path preference (blue) solution methods The robot starts at the lower left corner of the environment, and the goal of the task (pink circle) is in the upper left area The robot does not know which goal, among 10 options (shown in light blue squares), is the correct goal The human provides noisy observations, indicated by arrows, at each iteration The green robot selects actions according to the goal-only baseline, and the blue robot uses our proposed method to infer path preferences The polytopes composing G are drawn in blue Probability of correct goal WLPHVWHS +J (c) Entropy of goal distribution g 
Fig  6: Probability of the correct goal, fig 6b, and entropy of the goal belief distribution P (g), fig 6c, for the same problem setup, fig 6a In this problem instance, the human's preference is to go to the goal by passing on the right side of the obstacle Results are averaged over 50 runs and the area filled represents one standard deviation above and below the mean value The goal-only baseline shows an over-confident prediction (shown by the strong reduction in belief entropy) that the correct goal is less likely, making it more difficult to reach the correct goal compared to a method that accounts for path preference 
Success rates in the simple environment (Map 1) The results are averaged over 6 randomly sampled problem instances (start location, goal location, and goal possibilities), and over 50 runs per problem instance ∆T is the number of time steps separating two consecutive human inputs The robot's mission time is Tmax = 30 time steps We selected γ h = 1 5, corresponding to relatively noisy human inputs and making the problem more difficult to solve for the robot 
Computation times for Goal Only and Path Preference methods on Map 1 (fig 5a),Map 2 (fig 5b), and Map 3 (fig 5c),averaged over 100 runs with randomly sampled problem instances The 95 % confidence interval is provided with the mean We evaluate computation time at the first iteration of each run (where the search depth takes on its highest value Tmax) 

abstract

Robots that can effectively understand human intentions from actions are crucial for successful human-robot collaboration  In this work, we address the challenge of a robot navigating towards an unknown goal while also accounting for a human's preference for a particular path in the presence of obstacles 
This problem is particularly challenging when both the goal and path preference are unknown a priori  To overcome this challenge, we propose a method for encoding and inferring path preference online using a partitioning of the space into polytopes  Our approach enables joint inference over the goal and path preference using a stochastic observation model for the human 
We evaluate our method on an unknown-goal navigation problem with sparse human interventions, and find that it outperforms baseline approaches as the human's inputs become increasingly sparse  We find that the time required to update the robot's belief does not increase with the complexity of the environment, which makes our method suitable for online applications 

INTRODUCTION

Collaboration between humans and robots has become increasingly important and one key aspect of this collaboration is the ability for robots to adapt to human decisions  In many scenarios, such as a robot navigating through a busy room to deliver an item, it is important for the robot to take into account human preferences 
For instance, humans may prefer a specific path that would allow their colleagues to notice the item being delivered, but this preference may change dynamically based on various factors such as changes in the environment or unforeseen circumstances  While some preferences can be incorporated into the path-planning process, accommodating dynamic user preferences in real-time remains challenging 
In this paper, we propose a way to enable robots to adapt to human preferences dynamically by leveraging real-time feedback to inform decision-making  In this work, we tackle the problem of robot navigation in which the robot cannot observe the goal or the preferred path to the goal, but must make navigation decisions that are influenced by humans through recommended actions 
Prior work has explored how to adapt to a human's preference through feedback, but such approaches often require a high level of intervention, which can be time-consuming and impractical in real-world scenarios  To optimize the use of human input and quickly infer the human's preference, Fig  : An autonomous robot navigates in a simulated classroom towards a goal location (pink circle) 
At the start of its mission, it receives direction indications (arrows) from a human that indicate which path it should take to get to the goal  In this scenario, the human wants the robot to go around the desks on the right side of the classroom  A robot that does not reason over path preferences (green) will take the shortest path to the goal regardless of the human's input 
Our method (blue) infers the human's path preference from these indications and adapts to their recommendations  we propose an approach that leverages probabilistic representations of human preference and incorporates real-time feedback  Previous research by Bajcsy et al  considered an online adaptation problem in a manipulation task, where the person can apply forces to the robot to indicate their preferences 
By allowing the robot to continue its task while taking into account a probabilistic representation of human preference, their approach does not require frequent inputs  Building on this idea, we adopt a similar approach to adapt to a human's preference in the context of a robot autonomously navigating through a known environment, such as a cluttered office space 
Specifically, we focus on allowing the human to influence the robot's trajectory with respect to obstacles, by providing guidance on preferred routes or paths, while the robot continues to execute its task  Paths can be represented using homotopy classes   However, homotopies can pose computational challenges when used to encode and infer human preferences 
When the robot maintains a belief over homotopy classes, the inference problem can become exponentially complex with the number of obstacles in the space  Additionally, when the goal is unknown, the number of variables increases with the number of candidate destinations  This complexity can render the decision-making problem intractable 
Our solution is to encode path preference based on a partitioning of the environment into polytopes   This representation allows path preferences to be expressed as sets of preferred transitions between adjacent polytopes  Paths belonging to different homotopy classes correspond to different sequences of transitions 
By leveraging conditional independence assumptions, we can make the Bayesian inference problem tractable  These assumptions exploit the fact that human actions provide information about the path in a piece-wise manner  For example, indicating a preference for navigating around a particular obstacle only provides information about the local area and not the entire path 
Finally, after updating its belief representation over the human's preference, the robot can adapt to indications by replanning online  Our contributions are as follows  • We formulate the human-robot collaboration problem as a Partially Observable Markov Decision Process (POMDP) where both the goal of the task and the human's path preference are unknown random variables 
• We propose an encoding of a human's path preference using a partitioning of the environment into polytopes, along with conditional independence assumptions that make the Bayesian inference problem tractable to infer the task goal and path preference online  • Through simulations in two environments of different sizes and complexity, we show that our method is effective for solving problems where the robot must reach a goal that is unknown a-priori while simultaneously adapting to a human's indications 
Our method shows higher success rates compared to baseline approaches when the human inputs are sparse  Our approach enables a robot to make effective navigation decisions in collaboration with a human, even when the goal and path preference are not known in advance, and with minimal human input  In recent years, there has been a growing interest in shared autonomy and interactive systems, where humans and robots work together to accomplish tasks 
Several approaches have been proposed to address the challenge of enabling effective collaboration between human and robot agents while still achieving high task performance  Losey et al  and Jeon, Losey, and Sadigh propose a framework where a human operator is given control of a task-relevant latent action space while an autonomous system handles the rest 
Dragan and Srinivasa present a formalism for arbitrating between a user's input and a robot's policy when both human and robot share control of the same action space  Cognetti et al  [7] provide a method for real-time modifications of a path,       Fig  : We model the intent inference problem with the above diagram 
At each step in time, the robot receives an observation ot from the human conditioned on its current location st, the intended goal g, and the human's path preference θ  The robot updates its belief over g and θ and transitions to a next location st+1  while Hagenow et al  present a method that allows an outside agent to modify key robot state variables and blends the changes with the original control 
However, a common challenge of these approaches is the high level of intervention required from humans  Best and Fitch propose a method for predicting an agent's intended trajectory from observations  Rather than maintaining a belief over the agent's future path, they infer the agent's intended goal among a set of candidate locations at the boundary of the space 
This approach provides information on where the agent is heading and generates a distribution of candidate future trajectories for the agent  Inferring the goal of the task among a discrete set of candidates is also relevant to the area of shared autonomy  Javdani, Srinivasa, and Bagnell propose a formalism for shared control of a robotic arm, where the robot must assist the human in picking up an object but needs to infer which object the human has chosen from joystick inputs 
Planning with homotopy class constraints is useful in problems where the robot's requirements are given with respect to obstacles, and Yi, Goodrich, and Seppi consider topological constraints provided by human operators  Bhattacharya propose an efficient algorithm for solving pathplanning problems under homotopic constraints 
However, the number of homotopy classes for a given problem can be infinite, and as the robot changes location and updates its representation of the world, carrying out inference over homotopy classes in a dynamic environment requires recomputing the set of homotopies at every iteration, making the belief update challenging 
Prior work has addressed the challenge of shared autonomy by considering how robots can infer a human's intended goal, or how they can infer the preferred path to a goal  However, we argue that inferring the goal and the path as separate problems can lead to over-confidence in incorrect beliefs about the user's preferences 
To illustrate this point, consider the following scenario: a robot and a human are collaborating to move an object from one end of a room to Fig  : Using the hyperplanes composing the H-representation of each obstacle, we construct a hyperplane arrangement of the obstacle-free space (a)  We define the human's preference for the robot's one step action choices as the posterior distribution (given all human input up to that point) over transitions from the current to the neighboring polytopes, i e  edges on the graph 
Each time the robot transitions to a new polytope, the set of neighbor polytopes and the distribution over human preferences are updated  another, but there is an obstacle in the way  The human would like the robot to take a path around the obstacle on the left, even though the goal is on the right  If the robot only infers the goal from the human's inputs, it may incorrectly assume that the goal is on the right, and become over-confident in this belief 
On the other hand, if the robot only infers the preferred path, it may mistakenly assume that the goal is on the left, leading to a failure in completing the task  To overcome these challenges, our work proposes a joint inference approach that considers both the human's intended goal and their preferred path to that goal 
Specifically, we model the human's preference over different homotopy classes and leverage a conditional independence assumption to provide a tractable solution  In our approach, we assume that the human's inputs are noisily rational conditioned on both the goal and the preference  By jointly inferring the goal and path preference, we can avoid over-confidence in incorrect beliefs about the user's preferences, leading to improved system performance 
We consider the problem of robot navigation in a known environment to an unknown destination, where a human can intervene and provide a heading direction to the robot using a joystick or force cues  The human also has a preference on which path the robot should take with respect to obstacles, and our objective is for the robot to understand the human's intentions and execute the task with minimal interventions 
Let g be a discrete random variable denoting the goal of the task, belonging to a set of candidates Ω g , and let θ be a discrete-valued random variable representing the human's path preference, belonging to a set of possible preferences Θ  The physical location of the robot at time index t is denoted by s t ∈ R 2 , and the robot's action at time index t, belonging to some action space A, is denoted by a t  
The transition model T (s t+1 | s t , a t ) is deterministic, meaning the robot has full control over its future location  At any time step, the human may provide an observation to the robot  When the human intervenes, the robot receives a direction (heading angle) that can be mapped to a future location in space 
More specifically, we map the direction to an intended location, which is the resulting robot location after advancing in the indicated direction for one time step  For simplicity, we consider that the robot directly makes an observation o t of the location indicated by the human  We assume that the robot has a stochastic observation model for the human P (o t | s t , g, θ) that is conditioned on both the goal of the task g and the human's preferred path θ 
We further assume that having chosen a goal and path preference, the human takes actions to noisily minimize a cost function C g,θ that measures the cost of moving from the robot's current location to the goal along the preferred path  For example, C g,θ (s t , o t ) can be the length of the shortest path from location s t to the goal g after taking a first step to o t , and constrained by path preference θ 
We use C g,θ to induce a probability distribution over observations, given by: where γ h is a hyperparameter that designates the rationality coefficient  This model assumes the human will pick the lowest cost action with the highest probability and the likelihood of an action decreases exponentially with the increase in cost  
Our inclusion of the path preference θ sets our approach apart from   The model is shown in fig  represented as a Bayesian Network 

Inference

At each time step where the human provides an observation, the posterior P (g, θ) is given through the Bayesian update We note that the number of Bayesian updates required at each iteration to update the belief is equal to the cardinality of Ω g × Θ  In addition, each Bayesian update involves computing C g,θ ( 



ground_truth: Physics, biology, social sciences, finance, and neuroscience are some fields in which the inverse problem is encountered.

prompt_front: Now, answer the following question based on the text below, only give me the answer and do not output any other words.

Question: What was the name of the first white settlement in McPherson County?

Read the following text and answer briefly.

Context 2: 32% Asian, 0 06% Pacific Islander, 0 79% from other races, and 1 16% from two or more races   1 94% of the population were Hispanic or Latino of any race  37 1% were of German, 12 9% Swedish, 12 1% American, 6 7% English and 6 3% Irish ancestry according to Census 2000 

There were 11,205 households, out of which 33 00% had children under the age of 18 living with them, 62 50% were married couples living together, 6 00% had a female householder with no husband present, and 28 90% were non-families  25 50% of all households were made up of individuals, and 11 80% had someone living alone who was 65 years of age or older   The average household size was 2 49 and the average family size was 2 99 

In the county, the population was spread out, with 25 40% under the age of 18, 10 30% from 18 to 24, 25 20% from 25 to 44, 21 80% from 45 to 64, and 17 30% who were 65 years of age or older   The median age was 38 years  For every 100 females there were 95 90 males   For every 100 females age 18 and over, there were 92 90 males 

The median income for a household in the county was $41,138, and the median income for a family was $48,243  Males had a median income of $33,530 versus $21,175 for females  The per capita income for the county was $18,921   About 4 20% of families and 6 60% of the population were below the poverty line, including 5 20% of those under age 18 and 8 10% of those age 65 or over 

Government

Presidential elections
McPherson county is often carried by Republican candidates  The last time a Democratic candidate has carried this county was in 1964 by Lyndon B  Johnson 

Laws
Following amendment to the Kansas Constitution in 1986, the county remained a prohibition, or "dry", county until 1996, when voters approved the sale of alcoholic liquor by the individual drink with a 30 percent food sales requirement 

Education

Colleges
 McPherson College in McPherson
 Bethany College in Lindsborg
 Central Christian College in McPherson

Unified school districts
 Smoky Valley USD 400
 McPherson USD 418
 Canton-Galva USD 419
 Moundridge USD 423
 Inman USD 448

School district office in neighboring county
 Goessel USD 411
 Little River-Windom USD 444

Museums
 Birger Sandzén Memorial Gallery in Lindsborg
 McCormick-Deering Days Museum in Inman
 McPherson Museum in McPherson
 Lindsborg Old Mill & Swedish Heritage Museum in Lindsborg
 Kansas Motorcycle Museum in Marquette

Communities

Cities

 Canton
 Galva
 Inman
 Lindsborg
 Marquette
 McPherson (county seat) 
 Moundridge
 Windom

Unincorporated communities
† means a Census-Designated Place (CDP) by the United States Census Bureau 
 Conway
 Elyria†
 Groveland
 Johnstown
 New Gottland
 Roxbury†

Ghost towns
 Alta Mills
 Battle Hill
 Christian
 Doles Park
 Elivon
 King City
 Sweadal

Townships
McPherson County is divided into twenty-five townships   The cities of Lindsborg and McPherson are considered governmentally independent and are excluded from the census figures for the townships   In the following table, the population center is the largest city (or cities) included in that township's population total, if it is of a significant size 

See also
 List of people from McPherson County, Kansas
 National Register of Historic Places listings in McPherson County, Kansas
 McPherson Valley Wetlands
 Maxwell Wildlife Refuge

References

Notes

Further reading

 Wheeler, Wayne Leland  "An Analysis of Social Change in a Swedish-Immigrant Community: The Case of Lindsborg, Kansas " (PhD dissertation, University of Missouri-Columbia; ProQuest Dissertations Publishing, 1959  5905657) 

County
 Through the Years: A Pictorial History of McPherson County; McPherson Sentinel' Heritage House Publishing Co; 1992 
 McPherson County First Courthouse Built About 1869 or 1870; Lindsborg News-Record; March 30, 1959 
 Pioneer Life and Lore of McPherson County, Kansas; Edna Nyquist; Democratic-Opinion Press; 1932 
 A History of the Church of the Brethren in Kansas (includes McPherson College history); Elmer LeRoy Craik; McPherson Daily; Republican Press; 397 pages; 1922 
 Portrait and Biographical Record of Dickinson, Saline, McPherson, and Marion Counties, Kansas; Chapman Bros; 614 pages; 1893 
 Standard Atlas of McPherson County, Kansas; Geo  A  Ogle & Co; 82 pages; 1921 
 Plat Book of McPherson County, Kansas; North West Publishing Co; 50 pages; 1903 
 Edwards' Atlas of McPherson County, Kansas; John P  Edwards; 51 pages; 1884 

Trails
 The Story of the Marking of the Santa Fe Trail by the Daughters of the American Revolution in Kansas and the State of Kansas; Almira Cordry; Crane Co; 164 pages; 1915  (Download 4MB PDF eBook)
 The National Old Trails Road To Southern California, Part 1 (LA to KC); Automobile Club Of Southern California; 64 pages; 1916  (Download 6 8MB PDF eBook)

Mennonite Settlements
 Impact of Mennonite settlement on the cultural landscape of Kansas; Brenda Martin; Kansas State University; 1985/1988  
 Mennonite settlement : the relationship between the physical and cultural environment; Susan Movle; University of Utah; 1975/1886 
 Status of Mennonite women in Kansas in their church and home relationships; Eva Harshbarger; Bluffton College; 1925/1945 

External links

County
 
 McPherson County - Directory of Public Officials
Historical
 , from Hatteberg's People'' on KAKE TV news
Maps
 McPherson County Maps: Current, Historic, KDOT
 Kansas Highway Maps: Current, Historic, KDOT
 Kansas Railroad Maps: Current, 1996, 1915, KDOT and Kansas Historical Society

 
Kansas counties
1867 establishments in Kansas




ground_truth: The first white settlement in McPherson County was Fuller's Ranch, established by Charles O. Fuller.

prompt_front: Now, answer the following question based on the text below, only give me the answer and do not output any other words.

Question: What is the main advantage of the proposed method in terms of computation time?

Read the following text and answer briefly.

Context 3: 
,   ) in eq  ( ), which involves solving an optimization problem (such as a shortest path problem)  In section IV, we propose a specific encoding of preference θ for resolving eq  ( ), while ensuring the number of computations of the cost C g,θ ( ,  ) per update does not grow exponentially with the number of obstacles 

Decision Making

We consider a navigation problem where the robot receives reward according to the model R(s t , g, θ, a t )  We wish to find the optimal policy π that maximizes the expected discounted sum of future rewards, with discount factor γ  The above problem is a Partially Observable Markov Decision Process (POMDP)  
In this section, we propose an encoding of human's path preference θ for computing the posterior in eq  ( )  Devifrom the concept of homotopy classes, we define the preference according to a partitioning of the environment into polytopes, as shown in fig  , creating a hyperplane arrangement of the space 
Hyperplane arrangements have been used by Vincent and Schwager in the context of Neural Network verification  In our setting, we leverage this representation to define path preferences as preferred transitions between adjacent regions of the space 

Hyperplane Arrangement

We assume a two-dimensional environment composed of m polytopic obstacles, each defined by their half-space representation (H-representation) where A i ∈ R di×2 and b i ∈ R di , and where d i is the number of edges (hyperplanes) composing polytope i  Let n = i d i be the total number of hyperplanes  We leverage each obstacle's H-representation to construct a hyperplane arrangement of the environment as shown in fig 
 e  a partitioning of the space into polytopes  More specifically, each location in space belongs to a polytope j for which we can write an H-representation of the form where α j i ∈ {−1, 1} di is a vector specific to polytope j and obstacle i corresponding to the relative position of any point in the set with respect to each hyperplane in O i  
Fig  : Intent inference model in a hyperplane arrangement of the obstacle free space  We spatially decompose the preference θ into a set of preferred neighboring polytopes per region of the space  Within each polytope j, the human preference pj is a discrete distribution over the preferred neighbor in N (j) 
We assume that for a location st belonging to polytope j, and given goal g and preference pj, the observation ot and any other preference p i,i =j are conditionally independent  Concatenating elements from each obstacle's Hrepresentation, we can write polytope j's H-representation as where Some of the constraints in eq  ( ) (corresponding to rows of A, b and α j ) are redundant, i e  the set P j does not change upon their removal 
We can further reduce the Hrepresentation of a polytope to include only non-redundant constraints  By removing the rows corresponding to redundant constraints, we obtain new matrices A j e , b j e and α j e such that we can write the polytope's reduced H-representation as The non-redundant constraints correspond to edges of the polytope 
In other words, as the robot continually moves in space, the first hyperplane that it will cross upon exiting the polytope will correspond to one of the polytope's nonredundant constraints  Vincent and Schwager outline an iterative method for removing redundant constraints by solving n linear programs 
We use this method in practice for computing α j e for each polytope  We can now characterize each polytope by a vector α j e ∈ {−1, 1} n j e , where n j e ≤ n is the number of essential constraints of the polytope  The polytopes P j partition the environment into a hyperplane arrangement 

Path Preference

In this section, we provide a definition of preference θ according to a graphical representation of the environment based on the hyperplane arrangement  Under this representation, a path preference corresponds to a set of preferred transitions  In other words, for each polytope in the space, the human will have a preference to which neighboring polytope they wish to transition 
Let G := (V, E) be an undirected graph, where vertices are obstacle-free polytopes, and edges connect two adjacent polytopes  Each polytope is described by a unique vector α j as defined in eq  ( )  Two polytopes are adjacent if they share non-redundant constraints (rows in eq  ( )) corresponding to the same hyperplane (i e  they are on opposite sides of the hyperplane) 
Let N (v) be the set of neighbors of a vertex v  For each vertex, we denote p v the discrete-valued random variable describing which edge in N (v) the human intends to transition to  Using this formalism, we define a path preference as the set of preferred transitions over all nodes in the graph, Let m θ = v∈V |N (v)| be the cardinality of Θ, and m g = |Ω g | the number of possible goals 
A priori, the number of Bayesian updates required to update the belief at every iteration should be m θ × m g   Now, let us assume the conditional independence relationships described by the new problem diagram in fig    More specifically, we introduce the assumption that conditioned on a robot location s t , the goal g, and the preference for the corresponding vertex p v in the graph, the observation o t and the preference for any other vertex are conditionally independent 
In other words, the observations the human provides can be defined conditioned only on the robot location, the goal, and the human's preference for its current vertex p v   By introducing this assumption, each update step only requires updating the joint (p v , g), reducing the number of cost computations to |N (v)| × m g  
We can notice that by introducing this assumption, we removed the direct relationship between the number of polytopes in the environment and the complexity of the Bayesian update in eq  ( )  In practice, components of θ are not mutually independent  For example, if the human preference at a vertex v 1 is
, it is unlikely that the human will also prefer p v2 = (v 2 , v 1 ) (turning back)  We can improve our model by assuming a dependent relationship between preferences for adjacent edges, which does not significantly increase the complexity of the inference problem  An interesting property of our encoding is that any two paths that belong to different homotopy classes will cross different sequences of polytopes, i e  they correspond to a different sequence of edges on G 
This can be proved by contradiction  Let us suppose that two continuous trajectories ξ 1 and ξ 2 , with the same start and end points and that do not intersect any obstacle, traverse the same regions in G in the same order  From the construction of the hyperplane arrangement, each polytope that the paths traverse through is obstacle-free 
Therefore, within each polytope, there is no obstacle in the area located in between the portions of ξ 1 and ξ 2 that belong to the region  A smooth transformation of ξ 1 into ξ 2 can be obtained by transforming each portion of ξ 1 belonging to the polytopes it intersects into the corresponding portion of ξ 2 for the same polytopes, where the extremities of the trajectory portions are connected to one another along the polytope's edges (where the same edge is crossed by both paths) 
Along this transformation, the paths do not intersect any obstacle, and therefore ξ 1 and ξ 2 belong to the same homotopy class 

EXPERIMENTS

We evaluate our model on a simulated navigation task where the robot must reach a goal that is unknown a priori while respecting the path preferences indicated by a human  The robot navigates in a grid world containing obstacles  The transition model is deterministic: the robot selects an adjacent location on the grid to reach at the next time step 
The robot is also allowed to take diagonal actions  Each location s t in the map can be mapped to a vertex v t ∈ G  Therefore, the actions leading to locations mapped to different vertices correspond to edges on the graph  We note f (s t , a t ) the edge crossed by taking action a t from location s t  
The robot is given a mission time limit T max for reaching the goal  In this problem, we assume that the human selects actions to noisily minimize a cost function C g,θ , where θ is defined as per eq  ( ), corresponding to the length of the shortest path to the goal constrained by the preference (where the robot is only allowed to make transitions on G along preferred edges) 
More specifically, where δ(s t , g | o t , p vt ) designates the length of the shortest path from s t to g passing by o t and constrained by preference p vt   This is a slight variant of the cost function proposed by Best and Fitch , where we add in a conditioning on the path preference  We compute costs by running the A path planning algorithm on the environment maps (grid worlds with diagonal actions) and impose preference constraints by pruning invalid transitions from the search tree 
Reward model  At each step in time, the robot receives a reward which is a sum of three components: a goal-specific reward a preference-specific reward or penalty We compute solutions to the POMDP defined in section III-B with the online solver POMCP , and with the particularity that within the rollouts, the robot does not expect to collect human inputs 
Each time a solution is computed, the robot takes an action and may receive an observation  If it does, it updates its belief distribution over the unknown problem variables and resolves the POMDP over a receding horizon 

Baselines

• Goal only  The robot solves the POMDP while ignoring the effects of path preference  Similarly to , we assume the human is taking action to minimize a goaldependent cost C g (s t , o t ) = δ(s t , g | o t ), where the conditioning on the preference is removed  We also omit the path preference's contribution to the reward R pref  
• Compliant  The robot complies with the human input, but does not take an initiative  If the user stops providing information, the robot continues in the last direction indicated for 5 time steps (conserving its momentum), then stops  • Blended  We designed an arbitration function to decide between our proposed policy (accounting for path preferences) and the user's recommendation when the robot receives inputs 
Our metric to evaluate confidence in the robot's prediction for the purpose of arbitration is the entropy of the intention distribution H(g, p i ), where p i denotes the preferred neighbor for the current region  Because our representation of the world is discrete, the arbitration is given by a step function 
Denoted by U , the action corresponding to the human's input, and P , the robot's prediction for the optimal action, we write the policy where we chose h = 1 6 as the confidence threshold 

Results

When evaluating the algorithm, we consider that a run is successful if the robot reached the goal within its allocated mission time T max and only made transitions between graph vertices corresponding to the human's preferences  We vary the time delay between human inputs, from constant guidance (∆ T = 1) to only a single observation (∆ T ≥ T max ) 
Success rates  Table I reports the success rates for experiments conducted over six randomly sampled problem instances and 50 runs per instance in Map 1 (fig  )  When the human provides inputs at every iteration, the compliant policy shows the highest success rates  However, as ∆ T increases, the compliant robot is not able to accomplish the task within the allotted time as it does not receive sufficient inputs to do so, and performance decreases compared to the autonomous baselines 
We find that in these runs, accounting for path preference consistently improves performance compared with the goal-only baseline  Results also show that blending the user's input with the robot's policy (Path Preference + Blend) when the human provides information leads to improved performance  Belief entropy 
Figure shows a challenging problem instance where the directions the human provides do not align directly with the shortest path to the goal  By ignoring the effects of preferences in the problem model (goal only), the robot quickly infers from observations that the upper left goal is less likely than others (P (g) drops) 
The strong decrease in entropy shows that the robot becomes overconfident in this prediction  Overconfidence in an incorrect goal will prevent the agent from finding the correct goal once the human's indications directly align with it, as it needs to correct for the wrong predictions, as shown in the path realization (fig 
)  In this realization, the goal-only method (green robot) fails to search the upper left area within the allotted time  By accounting for path preferences in its model, the blue robot's entropy over the goal distribution decreases more steadily, allowing for it to leverage the human's latest observations and reach the goal successfully 
shows an over-confident prediction (shown by the strong reduction in belief entropy) that the correct goal is less likely, making it more difficult to reach the correct goal compared to a method that accounts for path preference  Computation time  In table II we provide the time required to solve the POMDP, and the time required to update the robot's belief as it receives new observations 
We compute solutions on three maps: a simple 10 × 10 grid world with 8 polytopes (fig  ), a 10 × 10 grid world with 56 polytopes (fig  ), and a 20×20 grid world with 73 polytopes (fig  )  The latter environment being larger, we increase the mission time and the depth of the search tree in POMCP from T max = 30 (Map 1 and Map 2) to T max = 60 (Map 3) 
We do not notice an increase in the time required to update the robot's belief with an increase in problem complexity, which is consistent with our observation that the complexity of the Bayesian update should not increase with the number of obstacles or polytopes  On the contrary, the belief update time on Map 2 and Map 3, containing more obstacles, is reduced compared to the first map 
More obstacles result in fewer iterations when solving the constrained shortest path problem with A   Adding constraints due to the obstacles and polytopes reduces the size of the A search tree  C  Limitations Simulation environments  In our simulations, we hardcoded the preference policy over the maps (e g  in Map 1, go around the table counter-clockwise) 
We randomly sampled problem instances (start and goal locations, and goal options) to reduce the bias introduced by these preference choices  To best evaluate and compare the different approaches, it would be best to sample preferences among a distribution of preferences chosen by a human (for example, from benchmarks resulting from a collection of data) 
Creating such a benchmark is an interesting direction for future work  Hyperplane arrangement construction  The main limitation of our approach is that the size and geometry of each polytope depends strongly on the geometry of the obstacles, as seen in fig    Because of this, the robot can make predictions over preferences that are too refined compared with the topology of the environment 
A direct consequence is that when the size of the polytopes is small, the information provided by the human can be incorrectly interpreted as a preference on the robot's immediate action  Our method can be improved by changing the structure of the hyperplane arrangement so that it relies on the topology of the environment, but does not vary strongly with the geometry of the features in the environment 
For this purpose, topometric maps and region construction algorithms are promising directions  We presented an approach for encoding and inferring a human's path preference in an environment with obstacles  By leveraging a partitioning of the space into polytopes and a stochastic observation model, our method allows for joint inference over the goal and path preference even when both are unknown a-priori 
Our experiments on an unknown-goal navigation problem with sparse human interventions demonstrate the effectiveness of our approach and its suitability for online applications  The time required to update the robot's belief does not increase with the complexity of the environment, which further highlights the practicality of our method 



ground_truth: The time required to update the belief does not increase with the complexity of the environment.