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 proposed approach in this research paper?

Read the following text and answer briefly.

Context 1: \section{Introduction}
\label{sec:introduction}

Probabilistic models have proven to be very useful in a lot of applications in signal processing where signal estimation is needed \cite{rabiner1989tutorial,arulampalam2002tutorial,ji2008bayesian}  Some of their advantages are that 1) they force the designer to specify all the assumptions of the model, 2) they provide a clear separation between the model and the algorithm used to solve it, and 3) they usually provide some measure of uncertainty about the estimation 

On the other hand, adaptive filtering is a standard approach in estimation problems when the input is received as a stream of data that is potentially non-stationary  This approach is widely understood and applied to several problems such as echo cancellation \cite{gilloire1992adaptive}, noise cancellation \cite{nelson1991active}, and channel equalization \cite{falconer2002frequency} 

Although these two approaches share some underlying relations, there are very few connections in the literature  The first important attempt in the signal processing community to relate these two fields was the connection between a linear Gaussian state-space model (i e  Kalman filter) and the RLS filter, by Sayed and Kailath \cite{sayed1994state} and then by Haykin \emph{et al } \cite{haykin1997adaptive}  The RLS adaptive filtering algorithm emerges naturally when one defines a particular state-space model (SSM) and then performs exact inference in that model  This approach was later exploited in \cite{van2012kernel} to design a kernel RLS algorithm based on Gaussian processes 

A first attempt to approximate the LMS filter from a probabilistic perspective was presented in \cite{park2014probabilistic}, focusing on a kernel-based implementation  The algorithm of \cite{park2014probabilistic} makes use of a Maximum a Posteriori (MAP) estimate as an approximation for the predictive step  However, this approximation does not preserve the estimate of the uncertainty in each step, therefore degrading the performance of the algorithm 

In this work, we provide a similar connection between state-space models and least-mean-squares (LMS)  Our approach is based on approximating the posterior distribution with an isotropic Gaussian distribution  We show how the computation of this approximated posterior leads to a linear-complexity algorithm, comparable to the standard LMS  Similar approaches have already been developed for a variety of problems such as channel equalization using recurrent RBF neural networks \cite{cid1994recurrent}, or Bayesian forecasting \cite{harrison1999bayesian}  Here, we show the usefulness of this probabilistic approach for adaptive filtering 

The probabilistic perspective we adopt throughout this work presents two main advantages  Firstly, a novel LMS algorithm with adaptable step size emerges naturally with this approach, making it suitable for both stationary and non-stationary environments  The proposed algorithm has less free parameters than previous LMS algorithms with variable step size \cite{kwong1992variable,aboulnasr1997robust,shin2004variable}, and its parameters are easier to be tuned w r t  these algorithms and standard LMS  Secondly, the use of a probabilistic model provides us with an estimate of the error variance, which is useful in many applications 

Experiments with simulated and real data show the advantages of the presented approach with respect to previous works  However, we remark that the main contribution of this paper is that it opens the door to introduce more Bayesian machine learning techniques, such as variational inference and Monte Carlo sampling methods \cite{barber2012bayesian}, to adaptive filtering \\


\section{Probabilistic Model}

Throughout this work, we assume the observation model to be linear-Gaussian with the following distribution,

\begin{equation}
p(y_k|{\bf w}_k) = \mathcal{N}(y_k;{\bf x}_k^T {\bf w}_k , \sigma_n^2),
\label{eq:mess_eq}
\end{equation}
where  $\sigma_n^2$ is the variance of the observation noise, ${\bf x}_k$ is the regression vector and ${\bf w}_k$ is the parameter vector to be sequentially estimated, both $M$-dimensional column vectors 


In a non-stationary scenario, ${\bf w}_k$ follows a dynamic process  In particular, we consider a diffusion process (random-walk model) with variance $\sigma_d^2$ for this parameter vector:


\begin{equation}
p({\bf w}_k|{\bf w}_{k-1})= \mathcal{N}({\bf w}_k;{\bf w}_{k-1}, \sigma_d^2 {\bf I}),
\label{eq:trans_eq}
\end{equation}
where $\bf I$ denotes the identity matrix  In order to initiate the recursion, we assume the following prior distribution on ${\bf w}_k$

\begin{equation}
p({\bf w}_0)= \mathcal{N}({\bf w}_0;0, \sigma_d^2{\bf I}) \nonumber
\end{equation}

\section{Exact inference in this model: Revisiting the RLS filter}

Given the described probabilistic SSM, we would like to infer the posterior probability distribution $p({\bf w}_k|y_{1:k})$ 
Since all involved distributions are Gaussian, one can perform exact inference, leveraging the probability rules in a straightforward manner  The resulting probability distribution is
\begin{equation}
p({\bf w}_k|y_{1:k}) =  \mathcal{N}({\bf w}_k;{\bf\boldsymbol\mu}_{k}, \boldsymbol\Sigma_{k}), \nonumber
\end{equation}
in which the mean vector ${\bf\boldsymbol\mu}_{k}$ is given by
\begin{equation}
{\bf\boldsymbol\mu}_k = {\bf\boldsymbol\mu}_{k-1} + {\bf K}_k (y_k - {\bf x}_k^T {\bf\boldsymbol\mu}_{k-1}){\bf x}_k, \nonumber
\end{equation}
where we have introduced the auxiliary variable
\begin{equation}
{\bf K}_k = \frac{ \left(\boldsymbol\Sigma_{k-1} + \sigma_d^2 {\bf I}\right)}{{\bf x}_k^T  \left(\boldsymbol\Sigma_{k-1} + \sigma_d^2 {\bf I}\right)  {\bf x}_k + \sigma_n^2}, \nonumber
\end{equation}
and the covariance matrix $\boldsymbol\Sigma_k$ is obtained as
\begin{equation}
\boldsymbol\Sigma_k = \left( {\bf I} -  {\bf K}_k{\bf x}_k {\bf x}_k^T \right) ( \boldsymbol\Sigma_{k-1} +\sigma_d^2), \nonumber
\end{equation}
Note that the mode of $p({\bf w}_k|y_{1:k})$, i e  the maximum-a-posteriori estimate (MAP), coincides with the RLS adaptive rule
\begin{equation}
{{\bf w}}_k^{(RLS)} = {{\bf w}}_{k-1}^{(RLS)} + {\bf K}_k (y_k - {\bf x}_k^T {{\bf w}}_{k-1}^{(RLS)}){\bf x}_k  
\label{eq:prob_rls}
\end{equation}
This rule is similar to the one introduced in \cite{haykin1997adaptive} 

Finally, note that the covariance matrix $\boldsymbol\Sigma_k$ is a measure of the uncertainty of the estimate ${\bf w}_k$ conditioned on the observed data $y_{1:k}$  Nevertheless, for many applications a single scalar summarizing the variance of the estimate could prove to be sufficiently useful  In the next section, we show how such a scalar is obtained naturally when $p({\bf w}_k|y_{1:k})$ is approximated with an isotropic Gaussian distribution  We also show that this approximation leads to an LMS-like estimation 
 


\section{Approximating the posterior distribution: LMS filter }

The proposed approach consists in approximating the posterior distribution $p({\bf w}_k|y_{1:k})$, in general a multivariate Gaussian distribution with a full covariance matrix, by an isotropic spherical Gaussian distribution 

\begin{equation}
\label{eq:aprox_post}
\hat{p}({\bf w}_{k}|y_{1:k})=\mathcal{N}({\bf w}_{k};{\bf \hat{\boldsymbol\mu}}_{k}, \hat{\sigma}_{k}^2 {\bf I} ) 
\end{equation}

In order to estimate the mean and covariance of the approximate distribution $\hat{p}({\bf w}_{k}|y_{1:k})$, we propose to select those that minimize the Kullback-Leibler divergence with respect to the original distribution, i e , 

\begin{equation}
\{\hat{\boldsymbol\mu}_k,\hat{\sigma}_k\}=\arg \displaystyle{  \min_{\hat{\boldsymbol\mu}_k,\hat{\sigma}_k}} \{ D_{KL}\left(p({\bf w}_{k}|y_{1:k}))\| \hat{p}({\bf w}_{k}|y_{1:k})\right) \}  \nonumber
\end{equation}

The derivation of the corresponding minimization problem can be found in Appendix A  In particular, the optimal mean and the covariance are found as
\begin{equation}
{\hat{\boldsymbol\mu}}_{k} = {\boldsymbol\mu}_{k};~~~~~~ \hat{\sigma}_{k}^2 = \frac{{\sf Tr}\{ \boldsymbol\Sigma_k\} }{M} 
\label{eq:sigma_hat}
\end{equation}


We now show that by using \eqref{eq:aprox_post} in the recursive predictive and filtering expressions we obtain an LMS-like adaptive rule  First, let us assume that we have an approximate posterior distribution at $k-1$, $\hat{p}({\bf w}_{k-1}|y_{1:k-1}) =  \mathcal{N}({\bf w}_{k-1};\hat{\bf\boldsymbol\mu}_{k-1}, \hat{\sigma}_{k-1}^2 {\bf I} )$  Since all involved distributions are Gaussian, the predictive distribution
is obtained as %
\begin{eqnarray}
\hat{p}({\bf w}_k|y_{1:k-1}) &=& \int p({\bf w}_k|{\bf w}_{k-1}) \hat{p}({\bf w}_{k-1}|y_{1:k-1}) d{\bf w}_{k-1} \nonumber\\
&=& \mathcal{N}({\bf w}_k;{\bf\boldsymbol\mu}_{k|k-1}, \boldsymbol\Sigma_{k|k-1}), 
\label{eq:approx_pred}
\end{eqnarray}
where the mean vector and covariance matrix are given by
\begin{eqnarray}
\hat{\bf\boldsymbol\mu}_{k|k-1} &=& \hat{\bf\boldsymbol\mu}_{k-1} \nonumber \\
\hat{\boldsymbol\Sigma}_{k|k-1} &=& (\hat{\sigma}_{k-1}^2 + \sigma_d^2 ){\bf I}\nonumber 
\end{eqnarray}

From \eqref{eq:approx_pred}, the posterior distribution at time $k$ can be computed using Bayes' Theorem and standard Gaussian manipulations (see for instance \cite[Ch  4]{murphy2012machine})  Then, we approximate the posterior $p({\bf w}_k|y_{1:k})$ with an isotropic Gaussian,
\begin{equation}
\hat{p}({\bf w}_k|y_{1:k}) =  \mathcal{N}({\bf w}_k ; {\hat{\boldsymbol\mu}}_{k}, \hat{\sigma}_k^2 {\bf I} ),\nonumber
\end{equation}
where 
\begin{eqnarray}
{\hat{\boldsymbol\mu}}_{k} &= & {\hat{\boldsymbol\mu}}_{k-1}+ \frac{ (\hat{\sigma}_{k-1}^2+ \sigma_d^2)  }{(\hat{\sigma}_{k-1}^2+ \sigma_d^2)  \|{\bf x}_k\|^2 + \sigma_n^2} (y_k - {\bf x}_k^T {\hat{\boldsymbol\mu}}_{k-1}){\bf x}_k  \nonumber  \\
&=& {\hat{\boldsymbol\mu}}_{k-1}+ \eta_k (y_k - {\bf x}_k^T {\hat{\boldsymbol\mu}}_{k-1}){\bf x}_k   
\label{eq:prob_lms}
\end{eqnarray}
Note that, instead of a gain matrix ${\bf K}_k$ as in Eq ~\eqref{eq:prob_rls}, we now have a scalar gain $\eta_k$ that operates as a variable step size 


Finally, to obtain the posterior variance, which is our measure of uncertainty, we apply \eqref{eq:sigma_hat} and the trick ${\sf Tr}\{{\bf x}_k{\bf x}_k^T\}= {\bf x}_k^T{\bf x}_k= \|{\bf x}_k \|^2$,

\begin{eqnarray}
\hat{\sigma}_k^2 &=& \frac{{\sf Tr}(\boldsymbol\Sigma_k)}{M} \\
&=& \frac{1}{M}{\sf Tr}\left\{ \left( {\bf I} -  \eta_k {\bf x}_k {\bf x}_k^T \right) (\hat{\sigma}_{k-1}^2 +\sigma_d^2)\right\} \\
&=& \left(1 - \frac{\eta_k \|{\bf x}_k\|^2}{M}\right)(\hat{\sigma}_{k-1}^2 +\sigma_d^2) 
\label{eq:sig_k}
\end{eqnarray}
If MAP estimation is performed, we obtain  an adaptable step-size LMS estimation

\begin{equation}
{\bf w}_{k}^{(LMS)} = {\bf w}_{k-1}^{(LMS)} + \eta_k (y_k - {\bf x}_k^T {\bf w}_{k-1}^{(LMS)}){\bf x}_k, 	
\label{eq:lms}
\end{equation}
with
\begin{equation}
\eta_k = \frac{ (\hat{\sigma}_{k-1}^2+ \sigma_d^2)  }{(\hat{\sigma}_{k-1}^2+ \sigma_d^2)  \|{\bf x}_k\|^2 + \sigma_n^2} \nonumber
\end{equation}
At this point, several interesting remarks can be made:

\begin{itemize}

\item The adaptive rule \eqref{eq:lms} has linear complexity since it does not require us to compute the full matrix $\boldsymbol\Sigma_k$ 

\item For a stationary model, we have $\sigma_d^2=0$ in \eqref{eq:prob_lms} and \eqref{eq:sig_k}  In this case, the algorithm remains valid and both the step size and the error variance, $\hat{\sigma}_{k}$, vanish over time $k$  

\item Finally, the proposed adaptable step-size LMS has only two parameters, $\sigma_d^2$ and $\sigma_n^2$, (and only one, $\sigma_n^2$, in stationary scenarios) in contrast to other variable step-size algorithms \cite{kwong1992variable,aboulnasr1997robust,shin2004variable}  More interestingly, both $\sigma_d^2$ and $\sigma_n^2$ have a clear underlying physical meaning, and they can be estimated in many cases  We will comment more about this in the next section  
\end{itemize}



\section{Experiments}
\label{sec:experiments}

We evaluate the performance of the proposed algorithm in both stationary and tracking experiments  In the first experiment, we estimate a fixed vector ${\bf w}^{o}$ of dimension $M=50$  The entries of the vector are independently and uniformly chosen in the range $[-1,1]$  Then, the vector is normalized so that $\|{\bf w}^o\|=1$  Regressors $\boldsymbol{x}_{k}$ are zero-mean Gaussian vectors with identity covariance matrix  The additive noise variance is such that the SNR is $20$ dB  We compare our algorithm with standard RLS and three other LMS-based algorithms: LMS, NLMS \cite{sayed2008adaptive}, VSS-LMS \cite{shin2004variable} \footnote{The used parameters for each algorithm are: for RLS $\lambda=1$, $\epsilon^{-1}=0 01$; for LMS $\mu=0 01$; for NLMS $\mu=0 5$; and for VSS-LMS $\mu_{max}=1$, $\alpha=0 95$, $C=1e-4$ } The probabilistic LMS algorithm in \cite{park2014probabilistic} is not simulated because it is not suitable for stationary environments 

In stationary environments, the proposed algorithm has only one parameter, $\sigma^2_n$  We simulate both the scenario where we have perfectly knowledge of the amount of noise (probLMS1) and the case where the value $\sigma^2_n$ is $100$ times smaller than the actual value (probLMS2)  The Mean-Square Deviation (${\sf MSD} = {\mathbb E} \| {\bf w}_0 - {\bf w}_k \|^2$), averaged out over $50$ independent simulations, is presented in Fig  \ref{fig:msd_statationary} 



\begin{figure}[htb]
\centering
\begin{minipage}[b]{\linewidth}
  \centering
  \centerline{\includegraphics[width=\textwidth]{results_stationary_MSD}}
\end{minipage}
\caption{Performance in terms of MSD of probabilistic LMS with both optimal (probLMS1) and suboptimal (probLMS2) compared to LMS, NLMS, VS-LMS, and RLS }
\label{fig:msd_statationary}
\end{figure}

The performance of probabilistic LMS is close to RLS (obviously at a much lower computational cost) and largely outperforms previous variable step-size LMS algorithms proposed in the literature  Note that, when the model is stationary, i e  $\sigma^2_d=0$ in \eqref{eq:trans_eq},  both the uncertainty $\hat{\sigma}^2_k$, and the adaptive step size $\eta_k$, vanish over time  This implies that the error tends to zero when $k$ goes to infinity  Fig  \ref{fig:msd_statationary} also shows that the proposed approach is not very sensitive to a bad choice of its only parameter, as demonstrated by the good results of probLMS2, which uses a $\sigma^2_n$ that is $100$ times smaller than the optimal value  


\begin{figure}[htb]
\centering
\begin{minipage}[b]{\linewidth}
  \centering
  \centerline{\includegraphics[width=\textwidth]{fig2_final}}
\end{minipage}
\caption{Real part of one coefficient of the measured and estimated channel in experiment two  The shaded area represents two standard deviations from the prediction {(the mean of the posterior distribution)} }
\label{fig_2}
\end{figure}


\begin{table}[ht]
\begin{footnotesize}
\setlength{\tabcolsep}{2pt}
\def1 5mm{1 5mm}
\begin{center}
\begin{tabular}{|l@{\hspace{1 5mm}}|c@{\hspace{1 5mm}}|c@{\hspace{1 5mm}}|c@{\hspace{1 5mm}}|c@{\hspace{1 5mm}}|c@{\hspace{1 5mm}}|c@{\hspace{1 5mm}}|}
\hline
Method &  LMS &  NLMS & LMS-2013 & VSSNLMS & probLMS & RLS \\
\hline
\hline
MSD (dB) &-28 45 &-21 07 &-14 36 &-26 90 &-28 36 &-25 97\\
\hline                                                                     
\end{tabular}
\end{center}
\caption{Steady-state MSD of the different algorithms for the tracking of a real MISO channel }
\label{tab:table_MSD}
\end{footnotesize}

\end{table}
\newpage
In a second experiment, we test the tracking capabilities of the proposed algorithm with {real} data of a wireless MISO channel acquired in a realistic indoor scenario  More details on the setup can be found in \cite{gutierrez2011frequency}  Fig  \ref{fig_2} shows the real part of one of the channels, and the estimate of the proposed algorithm  The shaded area represents the estimated uncertainty for each prediction, i e  $\hat{\mu}_k\pm2\hat{\sigma}_k$  Since the experimental setup does not allow us to obtain the optimal values for the parameters, we fix these parameters to their values that optimize the steady-state mean square deviation (MSD)  \hbox{Table \ref{tab:table_MSD}} shows this steady-state MSD of the estimate of the MISO channel with different methods  As can be seen, the best tracking performance is obtained by standard LMS and the proposed method  





\section{Conclusions and Opened Extensions}
\label{sec:conclusions}

{We have presented a probabilistic interpretation of the least-mean-square filter  The resulting algorithm is an adaptable step-size LMS that performs well both in stationary and tracking scenarios  Moreover, it has fewer free parameters than previous approaches and these parameters have a clear physical meaning  Finally, as stated in the introduction, one of the advantages of having a probabilistic model is that it is easily extensible:}

\begin{itemize}
\item If, instead of using an isotropic Gaussian distribution in the approximation, we used a Gaussian with diagonal covariance matrix, we would obtain a similar algorithm with different step sizes and measures of uncertainty, for each component of ${\bf w}_k$  Although this model can be more descriptive, it needs more parameters to be tuned, and the parallelism with LMS vanishes 
\item Similarly, if we substitute the transition model of \eqref{eq:trans_eq} by an Ornstein-Uhlenbeck process, 

\begin{equation}
p({\bf w}_k|{\bf w}_{k-1})= \mathcal{N}({\bf w}_k;\lambda {\bf w}_{k-1}, \sigma_d^2), \nonumber
\label{eq:trans_eq_lambda}
\end{equation}
a similar algorithm is obtained but with a forgetting factor $\lambda$ multiplying ${\bf w}_{k-1}^{(LMS)}$ in \eqref{eq:lms}  This algorithm may have improved performance under such a kind of autoregresive dynamics of ${\bf w}_{k}$, though, again, the connection with standard LMS becomes dimmer 

\item As in \cite{park2014probabilistic}, the measurement model \eqref{eq:mess_eq} can be changed to obtain similar adaptive algorithms for classification, ordinal regression, and Dirichlet regression for compositional data  

\item A similar approximation technique could be applied to more complex dynamical models, i e  switching dynamical models \cite{barber2010graphical}  The derivation of efficient adaptive algorithms that explicitly take into account a switch in the dynamics of the parameters of interest is a non-trivial and open problem, though the proposed approach could be useful 

\item Finally, like standard LMS, this algorithm can be kernelized for its application in estimation under non-linear scenarios 

\end{itemize}


\begin{appendices}

\section{KL divergence between a general gaussian distribution and an isotropic gaussian}
\label{sec:kl}

 We want to approximate  $p_{{\bf x}_1}(x) = \mathcal{N}({\bf x}; \boldsymbol\mu_1,\boldsymbol\Sigma_1)$ by $p_{{\bf x}_2}({\bf x}) = \mathcal{N}({\bf x}; \boldsymbol\mu_2,\sigma_2^2 {\bf I})$  In order to do so, we have to compute the parameters of $p_{{\bf x}_2}({\bf x})$, $\boldsymbol\mu_2$ and $\sigma_2^2$, that minimize the following Kullback-Leibler divergence,

\begin{eqnarray}
D_{KL}(p_{{\bf x}_1}\| p_{{\bf x}_2}) &=&\int_{-\infty}^{\infty} p_{{\bf x}_1}({\bf x}) \ln{\frac{p_{{\bf x}_1}({\bf x})}{p_{{\bf x}_2}({\bf x})}}d{\bf x} \nonumber  \\
&= &  \frac{1}{2} \{ -M + {\sf Tr}(\sigma_2^{-2} {\bf I}\cdot \boldsymbol\Sigma_1^{-1})  \nonumber \\
  & &  + (\boldsymbol\mu_2 - \boldsymbol\mu_1 )^T \sigma^{-2}_2{\bf I} (\boldsymbol\mu_2 - \boldsymbol\mu_1 )  \nonumber \\
 & &   +  \ln \frac{{\sigma_2^2}^M}{\det\boldsymbol\Sigma_1} \}   
\label{eq:divergence}
\end{eqnarray}
Using symmetry arguments, we obtain 
\begin{equation}
\boldsymbol\mu_2^{*} =\arg \displaystyle{  \min_{\boldsymbol\mu_2}} \{ D_{KL}(p_{{\bf x}_1}\| p_{{\bf x}_2}) \} = \boldsymbol\mu_1 
\end{equation}
Then, \eqref{eq:divergence} gets simplified into 

\begin{eqnarray}
D_{KL}(p_{{\bf x}_1}\| p_{{\bf x}_2}) = \frac{1}{2}\lbrace { -M + {\sf Tr}(\frac{\boldsymbol\Sigma_1}{\sigma_2^{2}}) + \ln \frac{\sigma_2^{2M}}{\det\boldsymbol\Sigma_1}}\rbrace 
\end{eqnarray}
The variance $\sigma_2^2$ is computed in order to minimize this Kullback-Leibler divergence as

\begin{eqnarray}
\sigma_2^{2*} &=& \arg\min_{\sigma_2^2} D_{KL}(P_{x_1}\| P_{x_2}) \nonumber \\
 &=& \arg\min_{\sigma_2^2}\{ \sigma_2^{-2}{\sf Tr}\{\boldsymbol\Sigma_1\} + M\ln \sigma_2^{2} \}  
\end{eqnarray}
Deriving and making it equal zero leads to

\begin{equation}
\frac{\partial}{\partial \sigma_2^2} \left[ \frac{{\sf Tr}\{\boldsymbol\Sigma_1\}}{\sigma_2^{2}} + M \ln \sigma_2^{2} \right] = \left  {\frac{M}{\sigma_2^{2}}-\frac{{\sf Tr}\{\boldsymbol\Sigma_1\}}{(\sigma_2^{2})^2}}\right|_{\sigma_2^{2}=\sigma_2^{2*}}\left  =0 \right   
\nonumber
\end{equation}
Finally, since the divergence has a single extremum in $R_+$,
\begin{equation}
\sigma_2^{2*} = \frac{{\sf Tr}\{\boldsymbol\Sigma_1\}}{M} 
\end{equation}




\end{appendices}

\vfill
\clearpage

\bibliographystyle{IEEEbib}

Context 3: Brooksley Elizabeth Born (born August 27, 1940) is an American attorney and former public official who, from August 26, 1996, to June 1, 1999, was chair of the Commodity Futures Trading Commission (CFTC), the federal agency which oversees the U S  futures and commodity options markets  During her tenure on the CFTC, Born lobbied Congress and the President to give the CFTC oversight of off-exchange markets for derivatives, in addition to its role with respect to exchange-traded derivatives, but her warnings were ignored or dismissed, and her calls for reform resisted by other regulators <ref name="nytimes">Goodman, Peter S  The Reckoning - Taking Hard New Look at a Greenspan Legacy, The New York Times, October 9, 2008 </ref> Born resigned as chairperson on June 1, 1999, shortly after Congress passed legislation prohibiting her agency from regulating derivatives 

Early life and education
Born graduated from Abraham Lincoln High School (San Francisco, California) at the age of 16  She then attended Stanford University, where she majored in English and was graduated with the class of 1961   She initially wanted to become a doctor, but a guidance counsellor at Stanford advised her against medicine, so she majored in English literature instead 

She then attended Stanford Law School, one of only seven women in her class   She was the first female student ever to be named president of the Stanford Law Review  She received the "Outstanding Senior" award and graduated as valedictorian of the class of 1964 

Legal career
Immediately after law school Born was selected as a law clerk to judge Henry Edgerton of the U S  Court of Appeals for the District of Columbia Circuit  It was during this time that she met her first husband, Jacob C  Landau, who was a journalist covering the Federal courts at the time  Following her clerkship, she became an associate at the Washington, D C -based international law firm of Arnold & Porter  Born was attracted to Arnold & Porter because it was one of the few major law firms to have a woman partner at that time, Carolyn Agger, who was the head of the tax practice  Born took a two-year leave of absence from Arnold & Porter to accompany her first husband to Boston, where he had received a fellowship  During that time she worked as a research assistant to law professor Alan Dershowitz 

Born's early career at Arnold & Porter focused on international trade law, in which she represented a number of Swiss industries and the government of Switzerland  She developed a practice representing clients in numerous complex litigation and arbitration cases involving financial market transactions  Among her high-profile cases was the matter of the Hunt Brothers attempt to corner the market in silver in the 1970s  She made partner at Arnold & Porter, after moving to a three-day schedule to help raise her second child, and eventually rose to be the head of the firm's derivatives practice 

Born was among the first female attorneys to systematically address inequities regarding how the laws treated women  Born and another female lawyer, Marna Tucker, taught what is considered to have been the first "Women and the Law" course at Catholic University’s Columbus School of Law  The class exclusively concerned prejudicial treatment of women under the laws of the United States, past and present   Born and Tucker were surprised to discover that there was no textbook on the issue at the time   Born is also one of the co-founders of the National Women's Law Center  Born also helped rewrite the American Bar Association rules to make it possible for more women and minorities to sit on federal bench 

During her long legal career, and into her retirement, Born did much pro bono and other types of volunteer work  She was active in the American Bar Association, the largest professional organization of lawyers in the United States   Initially Born was named a member of the governing council of the ABA's Individual Rights Section, eventually becoming chairperson   Born and Tucker founded the ABA Women's Caucus, the first organization of female lawyers in the ABA   She held several other senior positions in the ABA, including being named the first woman member of the ABA's Standing Committee on the Federal Judiciary   As a member of the Judiciary Committee, Born provided testimony and opinion on persons nominated for federal judgeships  In 1980 she was named chair of the committee   As chair of the committee, Born was invited to address the U S  Congress regarding the nomination of Judge Sandra Day O'Connor to the U S  Supreme Court 

In 1993, Born's name was floated as a possible candidate for Attorney General of the United States, but Janet Reno was nominated 

In July 2009, Nancy Pelosi appointed Brooksley Born as a commissioner to the Financial Crisis Inquiry Commission (FCIC) 

Born and the OTC derivatives market
Born was appointed to the CFTC on April 15, 1994, by President Bill Clinton  Due to litigation against Bankers Trust Company by Procter and Gamble and other corporate clients, Born and her team at the CFTC sought comments on the regulation of over-the-counter derivatives, a first step in the process of writing CFTC regulations to supplement the existing regulations of the Federal Reserve System,  the Options Clearing Corporation, and the National Association of Insurance Commissioners  Born was particularly concerned about swaps, financial instruments that are traded over the counter between banks, insurance companies or other funds or companies, and thus have no transparency except to the two counterparties and the counterparties' regulators, if any   CFTC regulation was strenuously opposed by Federal Reserve chairman Alan Greenspan, and by Treasury Secretaries Robert Rubin and Lawrence Summers  On May 7, 1998, former SEC Chairman Arthur Levitt joined Rubin and Greenspan in objecting to the issuance of the CFTC's concept release



ground_truth: This research paper proposed an approach based on approximating the posterior distribution with an isotropic Gaussian distribution.

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: How does the transition probability of the environment affect the learning rate in the static agent?

Read the following text and answer briefly.

Context 2: Paper Info

Title: Environmental variability and network structure determine the optimal plasticity mechanisms in embodied agents
Publish Date: Unkown
Author List: Sina Khajehabdollahi (from Department of Computer Science, University of Tübingen)

Figure

Figure2: An outline of the network controlling the foraging agent The sensor layer receives inputs at each time step (the ingredients of the nearest food), which are processed by the plastic layer in the same way as the static sensory network, Fig 1 The output of that network is given as input to the motor network, along with the distance d and angle α to the nearest food, the current velocity v, and energy E of the agent These signals are processed through two hidden layers to the final output of motor commands as the linear and angular acceleration of the agent
Figure4: The evolved parameters θ = (θ 1 ,      , θ 8 ) of the plasticity rule for the reward prediction (a ) and the decision (b ) tasks, for a variety of parameters (p tr = 0 01, d e ∈ 0, 0 1,      , 1, and σ ∈ 0, 0 1,      , 1 in all 100 combinations) Despite the relatively small difference between the tasks, the evolved learning rules differ considerably For visual guidance, the lines connect θs from the same run 
Figure5: a The trajectory of an agent (blue line) in the 2D environment A well-trained agent will approach and consume food with positive values (green dots) and avoid negative food (red dots) b The learning rate of the plastic sensory network eta p grows with the distance between environments d e c  and decreases with the frequency of environmental change d The fitness of an agent (measured as the total food consumed over its lifetime) increases over generations of the EA for both the scalar and binary readouts in the sensory network e The Pearson correlation coefficient of an evolved agent's weights with the ingredient value vector of the current environment (E 1 -blue, E 2 -red) In this example, the agent's weights are anti-correlated with its environment, which is not an issue for performance since the motor network can interpret the inverted signs of food 

abstract

The evolutionary balance between innate and learned behaviors is highly intricate, and different organisms have found different solutions to this problem  We hypothesize that the emergence and exact form of learning behaviors is naturally connected with the statistics of environmental fluctuations and tasks an organism needs to solve 
Here, we study how different aspects of simulated environments shape an evolved synaptic plasticity rule in static and moving artificial agents  We demonstrate that environmental fluctuation and uncertainty control the reliance of artificial organisms on plasticity  Interestingly, the form of the emerging plasticity rule is additionally determined by the details of the task the artificial organisms are aiming to solve 
Moreover, we show that coevolution between static connectivity and interacting plasticity mechanisms in distinct sub-networks changes the function and form of the emerging plasticity rules in embodied agents performing a foraging task  One of the defining features of living organisms is their ability to adapt to their environment and incorporate new information to modify their behavior 
It is unclear how the ability to learn first evolved , but its utility appears evident  Natural environments are too complex for all the necessary information to be hardcoded genetically and more importantly, they keep changing during an organism's lifetime in ways that cannot be anticipated ;   The link between learning and environmental uncertainty and fluctuation has been extensively demonstrated in both natural ; , and artificial environments  
Nevertheless, the ability to learn does not come without costs  For the capacity to learn to be beneficial in evolutionary terms, a costly nurturing period is often required, a phenomenon observed in both biological , and artificial organisms   Additionally, it has been shown that in some complex environments, hardcoded behaviors may be superior to learned ones given limits in the agent's lifetime and envi-ronmental uncertainty ; ;  
The theoretical investigation of the optimal balance between learned and innate behaviors in natural and artificial systems goes back several decades  However, it has recently found also a wide range of applications in applied AI systems ;   Most AI systems are trained for specific tasks, and have no need for modification after their training has been completed 
Still, technological advances and the necessity to solve broad families of tasks make discussions about life-like AI systems relevant to a wide range of potential application areas  Thus the idea of open-ended AI agents that can continually interact with and adapt to changing environments has become particularly appealing 
Many different approaches for introducing lifelong learning in artificial agents have been proposed  Some of them draw direct inspiration from actual biological systems ;   Among them, the most biologically plausible solution is to equip artificial neural networks with some local neural plasticity , similar to the large variety of synaptic plasticity mechanisms ; ; that performs the bulk of the learning in the brains of living organisms  
The artificial plasticity mechanisms can be optimized to modify the connectivity of the artificial neural networks toward solving a particular task  The optimization can use a variety of approaches, most commonly evolutionary computation  The idea of meta-learning or optimizing synaptic plasticity rules to perform specific functions has been recently established as an engineering tool that can compete with stateof-the-art machine learning algorithms on various complex tasks ; ; Pedersen and Risi (2021);  
Additionally, it can be used to reverse engineer actual plasticity mechanisms found in biological neural networks and uncover their functions ;   Here, we study the effect that different factors (environ-arXiv:2303 06734v1 [q-bio NC] 12 Mar 2023 mental fluctuation and reliability, task complexity) have on the form of evolved functional reward-modulated plasticity rules 
We investigate the evolution of plasticity rules in static, single-layer simple networks  Then we increase the complexity by switching to moving agents performing a complex foraging task  In both cases, we study the impact of different environmental parameters on the form of the evolved plasticity mechanisms and the interaction of learned and static network connectivity 
Interestingly, we find that different environmental conditions and different combinations of static and plastic connectivity have a very large impact on the resulting plasticity rules  We imagine an agent who must forage to survive in an environment presenting various types of complex food particles  Each food particle is composed of various amounts and combinations of N ingredients that can have positive (food) or negative (poison) values 
The value of a food particle is a weighted sum of its ingredients  To predict the reward value of a given resource, the agent must learn the values of these ingredients by interacting with the environment  The priors could be generated by genetic memory, but the exact values are subject to change  To introduce environmental variability, we stochastically change the values of the ingredients 
More precisely, we define two ingredient-value distributions E 1 and E 2 and switch between them, with probability p tr for every time step  We control how (dis)similar the environments are by parametrically setting E 2 = (1 − 2d e )E 1 , with d e ∈ [0, 1] serving as a distance proxy for the environments; when d e = 0, the environment remains unchanged, and when d e = 1 the value of each ingredient fully reverses when the environmental transition happens 
For simplicity, we take values of the ingredients in E 1 equally spaced between -1 and 1 (for the visualization, see Fig  )  The static agent receives passively presented food as a vector of ingredients and can assess its compound value using the linear summation of its sensors with the (learned or evolved) weights, see Fig   
The network consists of N sensory neurons that are projecting to a single post-synaptic neuron  At each time step, an input X t = (x 1 ,       , x N ) is presented, were the value x i , i ∈ {1,       , N } represents the quantity of the ingredient i  We draw x i independently form a uniform distribution on the [0, 1] interval (x i ∼ U (0, 1)) 
The value of each ingredient w c i is determined by the environment (E 1 or E 2 )  The postsynaptic neuron outputs a prediction of the food X t value as y t = g(W X T t )  Throughout the paper, g will be either the identity function, in which case the prediction neuron is linear, or a step-function; however, it could be any other nonlinearity, such as a sigmoid or ReLU 
After outputting the prediction, the neuron receives feedback in the form of the real value of the input R t   The real value is computed as R t = W c X T t + ξ, where W c = (w c 1 ,       , w c N ) is the actual value of the ingredients, and ξ is a term summarizing the noise of reward and sensing system ξ ∼ N (0, σ) 
Figure : An outline of the static agent's network  The sensor layer receives inputs representing the quantity of each ingredient of a given food at each time step  The agent computes the prediction of the food's value y t and is then given the true value R t ; it finally uses this information in the plasticity rule to update the weight matrix 
For the evolutionary adjustment of the agent's parameters, the loss of the static agent is the sum of the mean squared errors (MSE) between its prediction y t and the reward R t over the lifetime of the agent  The agent's initial weights are set to the average of the two ingredient value distributions, which is the optimal initial value for the case of symmetric switching of environments that we consider here 
As a next step, we incorporate the sensory network of static agents into embodied agents that can move around in an environment scattered with food  To this end, we merge the static agent's network with a second, non-plastic motor network that is responsible for controlling the motion of the agent in the environment 
Specifically, the original plastic network now provides the agent with information about the value of the nearest food  The embodied agent has additional sensors for the distance from the nearest food, the angle between the current velocity and the nearest food direction, its own velocity, and its own energy level (sum of consumed food values) 
These inputs are processed by two hidden layers (of 30 and 15 neurons) with tanh activation  The network's outputs are angular and linear acceleration, Fig    The embodied agents spawn in a 2D space with periodic boundary conditions along with a number of food particles that are selected such that the mean of the food value distribution is ∼ 0  An agent can eat food by approaching it sufficiently closely, and each time a food particle is eaten, it is The sensor layer receives inputs at each time step (the ingredients of the nearest food), which are processed by the plastic layer in the same way as the static sensory network, Fig   
The output of that network is given as input to the motor network, along with the distance d and angle α to the nearest food, the current velocity v, and energy E of the agent  These signals are processed through two hidden layers to the final output of motor commands as the linear and angular acceleration of the agent re-spawned with the same value somewhere randomly on the grid (following the setup of ) 
After 5000 time steps, the cumulative reward of the agent (the sum of the values of all the food it consumed) is taken as its fitness  During the evolutionary optimization, the parameters for both the motor network (connections) and plastic network (learning rule parameters) are co-evolved, and so agents must simultaneously learn to move and discriminate good/bad food 
Reward-modulated plasticity is one of the most promising explanations for biological credit assignment   In our network, the plasticity rule that updates the weights of the linear sensor network is a rewardmodulated rule which is parameterized as a linear combination of the input, the output, and the reward at each time step:
Additionally, after each plasticity step, the weights are normalized by mean subtraction, an important step for the stabilization of Hebbian-like plasticity rules   We use a genetic algorithm to optimize the learning rate η p and amplitudes of different terms θ = (θ 1 ,       , θ 8 )  The successful plasticity rule after many food presentations must converge to a weight vector that predicts the correct food values (or allows the agent to correctly decide whether to eat a food or avoid it) 
To have comparable results, we divide θ = (θ 1 ,       , θ 8 ) by We then multiply the learning rate η p with θ max to maintain the rule's evolved form unchanged, η norm p = η p • θ max   In the following, we always use normalized η p and θ, omitting norm   To evolve the plasticity rule and the moving agents' motor networks, we use a simple genetic algorithm with elitism  
The agents' parameters are initialized at random (drawn from a Gaussian distribution), then the sensory network is trained by the plasticity rule and finally, the agents are evaluated  After each generation, the bestperforming agents (top 10 % of the population size) are selected and copied into the next generation 
The remaining 90 % of the generation is repopulated with mutated copies of the best-performing agents  We mutate agents by adding independent Gaussian noise (σ = 0 1) to its parameters  To start with, we consider a static agent whose goal is to identify the value of presented food correctly  The static reward-prediction network quickly evolves the parameters of the learning rule, successfully solving the prediction task 
We first look at the evolved learning rate η p , which determines how fast (if at all) the network's weight vector is updated during the lifetime of the agents  We identify three factors that control the learning rate parameter the EA converges to: the distance between the environments, the noisiness of the reward, and the rate of environmental transition 
The first natural factor is the distance d e between the two environments, with a larger distance requiring a higher learning rate, Fig    This is an expected result since the convergence time to the "correct" weights is highly dependent on the initial conditions  If an agent is born at a point very close to optimality, which naturally happens if the environments are similar, the distance it needs to traverse on the fitness landscape is small 
Therefore it can afford to have a small learning rate, which leads to a more stable convergence and is not affected by noise  A second parameter that impacts the learning rate is the variance of the rewards  The reward an agent receives for the plasticity step contains a noise term ξ that is drawn from a zero mean Gaussian distribution with standard deviation σ 
This parameter controls the unreliability of the agent's sensory system, i e , higher σ means that the information the agent gets about the value of the foods it consumes cannot be fully trusted to reflect the actual value of the foods  As σ increases, the learning rate η p decreases, which means that the more unreliable an environment becomes, the less an agent relies on plasticity to update its weights, Fig   
Indeed for some combinations of relatively small distance d e and high reward variance σ, the EA converges to a learning rate of η p ≈ 0  This means that the agent opts to have no adaptation during its lifetime and remain at the mean of the two environments  It is an optimal solution when the expected loss due to ignoring the environmental transitions is, on average, lower than the loss the plastic network will incur by learning via the (often misleading because of the high σ) environmental cues 
A final factor that affects the learning rate the EA will converge to is the frequency of environmental change during an agent's lifetime  Since the environmental change is modeled as a simple, two-state Markov process (Fig  ), the control parameter is the transition probability p tr   When keeping everything else the same, the learning rate rapidly rises as we increase the transition probability from 0, and after reaching a peak, it begins to decline slowly, eventually reaching zero (Fig  ) 
This means that when environmental transition is very rare, agents opt for a very low learning rate, allowing a slow and stable convergence to an environment-appropriate weight vector that leads to very low losses while the agent remains in that environment  As the rate of environmental transition increases, faster learning is required to speed up convergence in order to exploit the (comparatively shorter) stays in each environment 
Finally, as the environmental transition becomes too fast, the agents opt for slower or even no learning, which keeps them ) and the decision (b ) tasks, for a variety of parameters (p tr = 0 01, d e ∈ 0, 0 1,       , 1, and σ ∈ 0, 0 1,       , 1 in all 100 combinations)  Despite the relatively small difference between the tasks, the evolved learning rules differ considerably 
For visual guidance, the lines connect θs from the same run  near the middle of the two environments, ensuring that the average loss of the two environments is minimal (Fig  )  The form of the evolved learning rule depends on the task: Decision vs  Prediction The plasticity parameters θ = (θ 1 ,       , θ 8 ) for the rewardprediction task converge on approximately the same point, regardless of the environmental parameters (Fig  ) 
In particular, θ 3 → 1, θ 5 → −1, θ i → 0 for all other i, and thus the learning rule converges to: Since by definition y t = g(W t X T t ) = W t X T t (g(x) = x in this experiment) and R t = W c X T t + ξ we get: Thus the distribution of ∆W t converges to a distribution with mean 0 and variance depending on η p and σ and W converges to W c  
So this learning rule will match the agent's weight vector with the vector of ingredient values in the environment  We examine the robustness of the learning rule the EA discovers by considering a slight modification of our task  Instead of predicting the expected food value, the agent now needs to decide whether to eat the presented food or not 
This is done by introducing a step-function nonlinearity (g(x) = 1 if x ≥ 1 and 0 otherwise)  Then the output y(t) is computed as: Instead of the MSE loss between prediction and actual value, the fitness of the agent is now defined as the sum of the food values it chose to consume (by giving y t = 1)  Besides these two changes, the setup of the experiments remains exactly the same 
The qualitative relation between η p and parameters of environment d e , σ and p tr is preserved in the changed experiment  However, the resulting learning rule is significantly different (Fig  )  The evolution converges to the following learning rule: In both cases, the rule has the form ∆W t = η p X t [α y R t + β y ] 
Thus, the ∆W t is positive or negative depending on whether the reward R t is above or below a threshold (γ = −β y /α y ) that depends on the output decision of the network (y t = 0 or 1)  Both learning rules (for the reward-prediction and decision tasks) have a clear Hebbian form (coordination of preand post-synaptic activity) and use the incoming reward signal as a threshold 
These similarities indicate some common organizing principles of reward-modulated learning rules, but their significant differences highlight the sensitivity of the optimization process to task details  We now turn to the moving embodied agents in the 2D environment  To optimize these agents, both the motor network's connections and the sensory network's plasticity parameters evolve simultaneously 
Since the motor network is initially random and the agent has to move to find food, the number of interactions an agent experiences in its lifetime can be small, slowing down the learning  However, having the larger motor network also has benefits for evolution because it allows the output of the plastic network to be read out and transformed in different ways, resulting in a broad set of solutions 
The fitness of an agent (measured as the total food consumed over its lifetime) increases over generations of the EA for both the scalar and binary readouts in the sensory network  e  The Pearson correlation coefficient of an evolved agent's weights with the ingredient value vector of the current environment (E 1 -blue, E 2 -red) 
In this example, the agent's weights are anti-correlated with its environment, which is not an issue for performance since the motor network can interpret the inverted signs of food  The agents can solve the task effectively by evolving a functional motor network and a plasticity rule that converges to interpretable weights (Fig  ) 
After ∼ 100 evolutionary steps (Fig  ), the agents can learn the ingredient value distribution using the plastic network and reliably move towards foods with positive values while avoiding the ones with negative values  We compare the dependence of the moving and the static agents on the parameters of the environment: d e and the state transition probability p tr  
At first, in order to simplify the experiment, we set the transition probability to 0, but fixed the initial weights to be the average of E 1 and E 2 , while the real state is E 2   In this experiment, the distance between states d e indicates twice the distance between the agent's initial weights and the optimal weights (the environment's ingredient values) since the agent is initialized at the mean of the two environment distributions 
Same as for the static agent, the learning rate increases with the distance d e (Fig  )  Then, we examine the effect of the environmental transition probability p tr on the evolved learning rate η p   In order for an agent to get sufficient exposure to each environment, we scale down the probability p tr from the equivalent experiment for the static agents 
We find that as the probability of transition increases, the evolved learning rate η p decreases (Fig  )  This fits with the larger trend for the static agent, although there is a clear difference when it comes to the increase for very small transition probabil-ities that were clearly identifiable in the static but not the moving agents 
This could be due to much sparser data and possibly the insufficiently long lifetime of the moving agent (the necessity of scaling makes direct comparisons difficult)  Nevertheless, overall we see that the associations observed in the static agents between environmental distance d e and transition probability p tr and the evolved learning rate η p are largely maintained in the moving agents 
Still, more data would be needed to make any conclusive assertions about the exact effect of these environmental parameters on the emerging plasticity mechanisms  A crucial difference between the static and the moving agents is the function the plasticity has to perform  While in the static agents, the plasticity has to effectively identify the exact value distribution of the environment in order to produce accurate predictions, in the embodied agents, the plasticity has to merely produce a representation of the environment that the motor network can evolve to interpret adequately enough to make decisions about which food to consume 
To illustrate the difference, we plot the Pearson correlation coefficient between an agent's weights and the ingredient values of the environment it is moving in (Fig  )  We use the correlation instead of the MSE loss (which we used for the static agents in Fig  ) because the amplitude of the vector varies a lot for different agents and meaningful The evolved parameters of moving agents' plasticity rule for the g(s) = x, identity (a ) and the step function (Eq 
4) (b ) sensory networks (the environmental parameters here are d e ∈ [0, 1], σ = 0 and p tr = 0 001)  The step function (binary output) network evolved a more structured plasticity rule (e g , θ 3 > 0 for all realizations) than the linear network  Moreover, the learned weights for the identity network (c ) have higher variance and correlate significantly less with the environment's ingredient distribution compared to the learned weights for the thresholded network (d )
conclusions cannot be drawn from the MSE loss  For many agents, the learned weights are consistently anti-correlated with the actual ingredient values (an example of such an agent is shown in Fig  )  This means that the output of the sensory network will have the opposite sign from the actual food value 
While in the static network, this would lead to very bad predictions and high loss, in the foraging task, these agents perform exactly as well as the ones where the weights and ingredients values are positively correlated, since the motor network can simply learn to move towards food for which it gets a negative instead of a positive sensory input 
This additional step of the output of the plastic network going through the motor network before producing any behavior has a strong effect on the plasticity rules that the embodied agents evolve  Specifically, if we look at the emerging rules the top performing agents have evolved (Fig  ), it becomes clear that, unlike the very well-structured rules of the static agents (Fig  ), there is now virtually no discernible pattern or structure 
The difference becomes even clearer if we look at the learned weights (at the end of a simulation) of the best-performing agents (Fig  )  While there is some correlation with the environment's ingredient value distribution, the variance is very large, and they do not seem to converge on the "correct" values in any way 
This is to some extent expected since, unlike the static agents where the network's output has to be exactly correct, driving the evolution of rules that converge to the precise environmental distribution, in the embodied networks, the bulk of the processing is done by the motor network which can evolve to interpret the scalar value of the sensory network's output in a variety of ways 
Thus, as long as the sensory network's plasticity rule co-evolves with the motor network, any plasticity rule that learns to produce consistent information about the value of encountered food can potentially be selected  To further test this assumption, we introduce a bottleneck of information propagation between the sensory and motor networks by using a step-function nonlinearity on the output of the sensory network (Eq 
4)  Similarly to the decision task of the static network, the output of the sensory network now becomes binary  This effectively reduces the flow of information from the sensory to the motor network, forcing the sensory network to consistently decide whether food should be consumed (with the caveat that the motor network can still interpret the binary sign in either of two ways, either consuming food marked with 1 or the ones marked with 0 by the sensory network) 
The agents perform equally well in this variation of the task as before (Fig  ), but now, the evolved plasticity rules seem to be more structured (Fig  )  Moreover, the variance of the learned weights in the bestperforming agents is significantly reduced (Fig  ), which indicates that the bottleneck in the sensory network is in-creasing selection pressure for rules that learn the environment's food distribution accurately 
We find that different sources of variability have a strong impact on the extent to which evolving agents will develop neuronal plasticity mechanisms for adapting to their environment  A diverse environment, a reliable sensory system, and a rate of environmental change that is neither too large nor too small are necessary conditions for an agent to be able to effectively adapt via synaptic plasticity 
Additionally, we find that minor variations of the task an agent has to solve or the parametrization of the network can give rise to significantly different plasticity rules  Our results partially extend to embodied artificial agents performing a foraging task  We show that environmental variability also pushes the development of plasticity in such agents 
Still, in contrast to the static agents, we find that the interaction of a static motor network with a plastic sensory network gives rise to a much greater variety of wellfunctioning learning rules  We propose a potential cause of this degeneracy; as the relatively complex motor network is allowed to read out and process the outputs from the plastic network, any consistent information coming out of these outputs can be potentially interpreted in a behaviorally useful way 
Reducing the information the motor network can extract from the sensory system significantly limits learning rule variability  Our findings on the effect of environmental variability concur with the findings of previous studies that have identified the constraints that environmental variability places on the evolutionary viability of learning behaviors 
We extend these findings in a mechanistic model which uses a biologically plausible learning mechanism (synaptic plasticity)  We show how a simple evolutionary algorithm can optimize the different parameters of a simple reward-modulated plasticity rule for solving simple prediction and decision tasks 
Reward-modulated plasticity has been extensively studied as a plausible mechanism for credit assignment in the brain ; ; and has found several applications in artificial intelligence and robotics tasks ;   Here, we demonstrate how such rules can be very well-tuned to take into account different environmental parameters and produce optimal behavior in simple systems 
Additionally, we demonstrate how the co-evolution of plasticity and static functional connectivity in different subnetworks fundamentally changes the evolutionary pressures on the resulting plasticity rules, allowing for greater diversity in the form of the learning rule and the resulting learned connectivity 
Several studies have demonstrated how, in biological networks, synaptic plasticity heavily interacts with and is driven by network topology   Moreover, it has been recently demonstrated that biological plasticity mechanisms are highly redundant in the sense that any observed neural connectivity or recorded activity can be achieved with a variety of distinct, unrelated learning rules  
This observed redundancy of learning rules in biological settings complements our results and suggests that the function of plasticity rules cannot be studied independently of the connectivity and topology of the networks they are acting on  The optimization of functional plasticity in neural networks is a promising research direction both as a means to understand biological learning processes and as a tool for building more autonomous artificial systems 
Our results suggest that reward-modulated plasticity is highly adaptable to different environments and can be incorporated into larger systems that solve complex tasks  This work studies a simplified toy model of neural network learning in stochastic environments  Future work could be built on this basic framework to examine more complex reward distributions and sources of environmental variability 
Moreover, a greater degree of biological realism could be added by studying more plausible network architectures (multiple plastic layers, recurrent and feedback connections) and more sophisticated plasticity rule parametrizations  Additionally, our foraging simulations were constrained by limited computational resources and were far from exhaustive 
Further experiments can investigate environments with different constraints, food distributions, multiple seasons, more complex motor control systems and interactions of those systems with different sensory networks as well as the inclusion of plasticity on the motor parts of the artificial organisms 
Context 3:  Their response dismissed Born's analysis and focused on the hypothetical possibility that CFTC regulation of swaps and other OTC derivative instruments could create a "legal uncertainty" regarding such financial instruments,  hypothetically reducing the value of the instruments  They argued that the imposition of regulatory costs would "stifle financial innovation" and encourage financial capital to transfer its  transactions offshore  The disagreement between Born and the Executive Office's top economic policy advisors has been described not only as a classic Washington turf war, but also a war of ideologies,  insofar as it is possible to argue that Born's actions were consistent with Keynesian and neoclassical economics while Greenspan, Rubin, Levitt, and Summers consistently espoused neoliberal, and neoconservative policies 

In 1998, a trillion-dollar hedge fund called Long Term Capital Management (LTCM) was near collapse   Using mathematical models to calculate debt risk, LTCM used derivatives to leverage $5 billion into more than $1 trillion, doing business with fifteen of Wall Street's largest financial institutions   The derivative transactions were not regulated, nor were investors able to evaluate LTCM's exposures   Born stated, "I thought that LTCM was exactly what I had been worried about"   In the last weekend of September 1998, the President's working group was told that the entire American economy hung in the balance   After intervention by the Federal Reserve, the crisis was averted   In congressional hearings into the crisis, Greenspan acknowledged that language had been introduced into an agriculture bill that would prevent CFTC from regulating the derivatives which were at the center of the crisis that threatened the US economy   U S  Representative Maurice Hinchey (D-NY) asked "How many more failures do you think we'd have to have before some regulation in this area might be appropriate?"  In response, Greenspan brushed aside the substance of Born's warnings with the simple assertion that "the degree of supervision of regulation of the over-the-counter derivatives market is quite adequate to maintain a degree of stability in the system"  Born's warning was that there wasn't any regulation of them   Born's chief of staff, Michael Greenberger summed up Greenspan's position this way: "Greenspan didn't believe that fraud was something that needed to be enforced, and he assumed she probably did  And of course, she did "  Under heavy pressure from the financial lobby, legislation prohibiting regulation of derivatives by Born's agency was passed by the Congress   Born resigned on June 1, 1999 

The derivatives market continued to grow yearly throughout both terms of George W  Bush's administration  On September 15, 2008, the bankruptcy of Lehman Brothers forced a broad recognition of a financial crisis in both the US and world capital markets   As Lehman Brothers' failure temporarily reduced financial capital's confidence, a number of newspaper articles and television programs suggested that the failure's possible causes included the conflict between the CFTC and the other regulators Faiola, Anthony, Nakashima, Ellen and Drew, Jill  The Crash: Risk and Regulation - What Went Wrong, The Washington Post, October 15, 2008 

Born declined to publicly comment on the unfolding 2008 crisis until March 2009, when she said: "The market grew so enormously, with so little oversight and regulation, that it made the financial crisis much deeper and more pervasive than it otherwise would have been " She also lamented the influence of Wall Street lobbyists on the process and the refusal of regulators to discuss even modest reforms 

An October 2009 Frontline documentary titled "The Warning"  described Born's thwarted efforts to regulate and bring transparency to the derivatives market, and the continuing opposition thereto  The program concluded with an excerpted interview with Born sounding another warning: "I think we will have continuing danger from these markets and that we will have repeats of the financial crisis -- may differ in details but there will be significant financial downturns and disasters attributed to this regulatory gap, over and over, until we learn from experience "

In 2009 Born, along with Sheila Bair of the FDIC, was awarded the John F  Kennedy Profiles in Courage Award in recognition of the "political courage she demonstrated in sounding early warnings about conditions that contributed" to the 2007-08 financial crisis   According to Caroline Kennedy, "Brooksley Born recognized that the financial security of all Americans was being put at risk by the greed, negligence and opposition of  powerful and well connected interests     The catastrophic financial events of recent months have  proved them [Born and Sheila Bair] right "  One member of the President's working group had a change of heart about Brooksley Born   SEC Chairman Arthur Levitt stated "I've come to know her as one of the most capable, dedicated, intelligent and committed public servants that I have ever come to know", adding that "I could have done much better  I could have made a difference" in response to her warnings 

In 2010, a documentary film Inside Job further alleged that derivatives regulation was ineffective from the Clinton administration on  Along with fellow whistleblower, former IMF Chief Economist Raghuram Rajan, who was also scorned by the economic establishment, Brooksley Born was cited as one of the authorities arguing that financial derivatives increase economic risk 

 Personal life 
Born is married to Alexander E  Bennett (also retired from Arnold & Porter)   She has five adult children - two from a previous marriage to Jacob Landau and three stepchildren  Notably, Born was named a partner at Arnold & Porter while working part-time so she could raise her two young children   When both of her children were school-age, Born returned to practice full-time 

References

External links
Attorney profile at Arnold & Porter
Brooksley Born (2009 Winner) of the Profiles in Courage Award, with acceptance speech transcript and NECN video

Profile at MarketsWiki
Speeches and statements
"Testimony Of Brooksley Born Chairperson of the CFTC Concerning The Over-The-Counter Derivatives Market", before the House Committee On Banking And Financial Services, July 24, 1998 
"The Lessons of Long Term Capital Management L P ", Remarks of Brooksley Born, Chairperson of the CFTC, Chicago-Kent-IIT Commodities Law Institute, Chicago, Illinois, October 15, 1998 
 Interview: Brooksley Born for "PBS Frontline: The Warning", PBS, (streaming VIDEO 1 hour), October 20, 2009 
Articles
Manuel Roig-Franzia  "Credit Crisis Cassandra:Brooksley Born's Unheeded Warning Is a Rueful Echo 10 Years On", The Washington Post, May 26, 2009
 Taibbi, Matt  "The Great American Bubble Machine", Rolling Stone'', July 9–23, 2009

1940 births
American women lawyers
Arnold & Porter people
Clinton administration personnel
Columbus School of Law faculty
Commodity Futures Trading Commission personnel
Heads of United States federal agencies
Lawyers from San Francisco
Living people
Stanford Law School alumni
21st-century American women
Stanford University alumni



ground_truth: As the transition probability increases, the learning rate initially rises and then declines.

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 award did Brooksley Born receive in 2009?

Read the following text and answer briefly.

Context 4: 306 show description
Packet of selected primary texts (to be linked or posted on Blackboard)  GOV 381L • American Founding 39040 • Spring 2013 Meets T 6:30PM-9:30PM BAT 1 104 show description
NOTE WELL: Course meets Tuesdays, 6:30 to 9:30pm
Batts Hall 1 104
This is a seminar on American political thought and constitutional design  It is designed for students of American politics and political theory  The principal themes include: 1) the nature of founding and its constitutive significance; 2) the relation of structure and power in American politics; 3) the meaning and significance of the Federalist/Anti-Federalist debate; 4) the philosophic background of the American founding; and 5) the relevance of the founding to debate to prospects for, and pathologies of, American politics today 
We will conduct a close reading of the Madison’s Notes, of The Federalist, and selected Anti-Federalist writings  We will also study a larger and growing body of secondary literature on the constitutional convention, ratification and early American political thought 
James Madison, Notes of the Debates: In the Federal Convention of 1787
The Federalist (Rossiter, ed )
The Anti-Federalist (Storing, ed )
David Brian Robertson, The Constitution and America’s Destiny (2005)
Pauline Maier, Ratification (2012)
Gordon Wood, The Idea of America (2011)
Jack Rakove, Original Meanings: Politics & Ideas in the Making of the Constitution
Herbert Storing, What the Anti-Federalists Were For (1981)
Numerous essays and articles (to be posted on line or gathered in packet)
Grading: Active seminar participation, including three short papers and presentations (40%) and one article-length seminar paper (60%) T C 357 • Amer Founding/Probs Const Des 43095 • Spring 2013 Meets M 3:30PM-6:30PM CRD 007B show description
The American Founding and Problems of Constitutional Design
Jeffrey Tulis, Associate Professor, Department of Government
Sanford Levinson, Professor, School of Law
This Plan II seminar will be built around a close reading of the debates that informed the drafting and ratification of the U S  Constitution  We aim to recover the perspective of these founding thinkers -- their way of thinking -- as much as their concrete ideas, in order to raise fundamental questions about the American political order today  Are some of the most important pathologies of American politics today rooted in design features of our original political architecture? Are the original answers to basic founding questions (such as "how democratic is our Constitution?) still adequate for contemporary circumstances? What features of the Constitution should we preserve and what features should we amend, if possible? Would it be good for the polity as a whole to reconsider these questions in a new constitutional convention today, or would such an event be a political nightmare? Our reading will include notes from the founding conventions, writings by Federalists and Anti-Federalists, and present-day critiques of the American political order  Our aim will be to generate a dialogue between the thought of the founders and some of the best present day critics and supporters of the Constitution 
James Madison, Notes of the Debates in the Federal Convention
The Federalist, ed  Clinton Rossiter
The Anti-Federalist, ed  Herbert Storing
Pauline Maier, Ratification: The People Debate the Constitution, 1787-1788
Sanford Levinson, Framed: America’s 51 Constitutions and the Crisis of Governance
Bruce Ackerman, The Decline and Fall of the American Republic
Robert Goldwin, ed  How Democratic is the Constitution?
a course packet of selected articles, essays, and additional primary materials 
Class participation, including at least one presentation of a short discussion paper 25%
One take-home analytic essay 25%
One term paper 50%
About the Professors:
Professor Tulis's interests bridge the fields of political theory and American politics, including more specifically, American political development, constitutional theory, political philosophy and the American presidency  He received the President's Associates Teaching Excellence Award at the University of Texas  He has held research fellowships from NEH, ACLS, Olin Foundation, Harvard Law School, and the Mellon Preceptorship at Princeton University, where he taught before moving to Texas  He has held visiting positions at Notre Dame and Harvard  During the academic year 2008-09, he was a Laurance S  Rockefeller Visiting Fellow at the University Center for Human Values at Princeton 
Proefessor Levinson holds the W  St  John Garwood and W  St  John Garwood, Jr  Centennial Chair in Law, he joined the University of Texas Law School in 1980  Previously a member of the Department of Politics at Princeton University, he is also a Professor in the Department of Government at the University of Texas  The author of over 350 articles and book reviews in professional and popular journals--and a regular contributor to the popular blog Balkinization  He received the Lifetime Achievement Award from the Law and Courts Section of the American Political Science Association in 2010  He has been a visiting faculty member of the Boston University, Georgetown, Harvard, New York University, and Yale law schools in the United States and has taught abroad in programs of law in London; Paris; Jerusalem; Auckland, New Zealand; and Melbourne, Australia 
GOV 330K • The American President 38675 • Fall 2012 Meets MW 3:00PM-4:30PM MEZ B0 306 show description
Packet of selected primary texts (to be linked or posted on Blackboard)  GOV 330K • The American President 38675 • Fall 2011 Meets MW 3:30PM-5:00PM WAG 420 show description
see syllabus GOV 330K • The American President 38680 • Fall 2011 Meets MW 5:30PM-7:00PM UTC 1 146 show description
see syllabus GOV 379S • Regime Persp On Amer Polit-Hon 39110 • Spring 2011 Meets W 3:30PM-6:30PM BAT 5 102 (also listed as CTI 326, LAH 350) show description
To see the polity as a whole requires that we get some distance from our subject, much as to see the planet earth as a whole requires one to look at it from outer space  Just as it is difficult to get visual perspective on a place living within it, it is difficult to understand the promise or pathologies of a regime from within it  To get critical distance from our politics, we will closely study three sets of texts that look at American politics from a distance  The first part of the course will recover the perspective of the founding debate between Federalists and Anti-federalists  This fundamental debate reveals what is a stake in the basic architecture of the American regime  The second part of the course is a close study of Tocqueville’s Democracy in America  Regarded by many as the best book ever written on democracy and the best book written on America, Tocqueville sees our polity whole because he looks at it from the vantage point of Europe, in general, and France, in particular  In the third part of the seminar we think about American politics from the perspective of thoughtful commentators who feel only nominally included in the polity  Half in and half out, these extraordinary black American writers reveal fissures and fault lines in the American regime  We end the class with a discussion of America’s place in the world today – examining a speech by a writer who articulately raises challenges to our self-understanding that are inarticulately expressed today in rage and ranting from enemies of the United States 
Four take home writing assignments  Analytic essays, each 1000-1500 words  (Grades weighted: 10%, 25%, 25%, and 25%) Late essays will not be accepted, except with a doctor’s excuse or a Dean’s excuse for family emergency  Regular preparation and class participation: 15% 
OR as an option: By prior arrangement with me by the due date of the second analytic essay, students may substitute one longer research paper (15 – 20 pages) for two of the last three analytic papers This paper will be on a topic of the students choosing , if I approve, and the due date will be the same as the last assigned analytic essay  This project would count 50% of the students course grade 
Selected writings by Frederick Douglass, W E B  Dubois, Ralph Ellison, James Baldwin
Solzhenitsyn, “A World Split Apart”
Tocqueville, Democracy in America GOV 382M • Tocqueville 39150 • Spring 2011 Meets T 6:30PM-9:30PM BAT 5 102 show description
See syllabus GOV 370L • President, Congress, And Court 38695 • Fall 2010 Meets TTH 8:00AM-9:30AM UTC 3 112 show description
Course Description: A Study of the political relationship of the President, Congress and Court in the American constitutional order  Has this relationship changed over the course of American history? Is American national politics prone to stalemate or deadlock between the branches regarding major issues of public policy? Do we have a new “imperial presidency?” Should the Court arbitrate disputes between the President and Congress over custody of their respective powers? Has Congress abdicated its constitutional responsibilities? We will examine questions like these in light of practical problems such as executive privilege and secrecy, the war on terror, budget politics and controversies regarding appointments to the Supreme Court  Grading:Three in class essay tests, for which study questions will be distributed in advance  The exam questions will be chosen from the list of study questions  (25% each) One short take home essay (10% each)  Class participation and attendance (15%)  Tentative Texts: The FederalistFisher, Congressional Abdication on War and SpendingRudalevige, The New Imperial PresidencyBessette and Tulis, The Constitutional PresidencySkowronek, Presidency in Political TimeGoldsmith, The Terror PresidencyA course packet of articles and essays GOV 370L • President, Congress, And Court 38700 • Fall 2010 Meets TTH 5:00PM-6:30PM UTC 3 122 show description
Course Description: A Study of the political relationship of the President, Congress and Court in the American constitutional order  Has this relationship changed over the course of American history? Is American national politics prone to stalemate or deadlock between the branches regarding major issues of public policy? Do we have a new “imperial presidency?” Should the Court arbitrate disputes between the President and Congress over custody of their respective powers? Has Congress abdicated its constitutional responsibilities? We will examine questions like these in light of practical problems such as executive privilege and secrecy, the war on terror, budget politics and controversies regarding appointments to the Supreme Court  Grading:Three in class essay tests, for which study questions will be distributed in advance  The exam questions will be chosen from the list of study questions  (25% each) One short take home essay (10% each)  Class participation and attendance (15%)  Tentative Texts: The FederalistFisher, Congressional Abdication on War and SpendingRudalevige, The New Imperial PresidencyBessette and Tulis, The Constitutional PresidencySkowronek, Presidency in Political TimeGoldsmith, The Terror PresidencyA course packet of articles and essays GOV 312L • Iss & Policies In Amer Gov-Hon 38698 • Spring 2010 Meets MW 3:30PM-5:00PM UTC 3 104 show description
Government 312L satisfies the second half of the mandated six hours of government that every UT student must take  Course covers analysis of varying topics concerned with American political institutions and policies, including the United States Constitution, and assumes basic knowledge of government from GOV 310L, which is a prerequiste  May be taken for credit only once  GOV 370L • President, Congress, And Court 38966 • Spring 2010 Meets MW 5:00PM-6:30PM MEZ B0 306 show description
Prerequisite: Six semester hours of lower-division coursework in government 
GOV 370L • President, Congress, And Court 39295 • Fall 2009 Meets TTH 2:00PM-3:30PM UTC 3 112 show description
GOV 370L • President, Congress, And Court 39435 • Spring 2008 Meets MW 3:00PM-4:30PM PAR 203 show description
GOV 312L • Iss & Policies In Am Gov-Hon-W 38615-38620 • Spring 2007 Meets MW 11:00AM-12:00PM MEZ B0 306 show description
Government 312L satisfies the second half of the mandated six hours of government that every UT student must take  Course covers analysis of varying topics concerned with American political institutions and policies, including the United States Constitution, and assumes basic knowledge of government from GOV 310L, which is a prerequiste  May be taken for credit only once  GOV 312L • Iss & Policies In Am Gov-Hon-W 37600-37605 • Spring 2006 Meets MW 11:00AM-12:00PM MEZ B0 306 show description
Government 312L satisfies the second half of the mandated six hours of government that every UT student must take  Course covers analysis of varying topics concerned with American political institutions and policies, including the United States Constitution, and assumes basic knowledge of government from GOV 310L, which is a prerequiste  May be taken for credit only once  GOV 312L • Iss & Policies In Am Gov-Hon-W 34900-34905 • Spring 2004 Meets MW 11:00AM-12:00PM BUR 134 show description
Government 312L satisfies the second half of the mandated six hours of government that every UT student must take  Course covers analysis of varying topics concerned with American political institutions and policies, including the United States Constitution, and assumes basic knowledge of government from GOV 310L, which is a prerequiste  May be taken for credit only once  GOV 312L • Iss & Policies In Am Gov-Hon-W 34495-34500 • Spring 2003 Meets MW 11:00AM-12:00PM UTC 1 130 show description
Government 312L satisfies the second half of the mandated six hours of government that every UT student must take  Course covers analysis of varying topics concerned with American political institutions and policies, including the United States Constitution, and assumes basic knowledge of government from GOV 310L, which is a prerequiste  May be taken for credit only once  Publications
Tulis, JK (2011), "Plausible Futures," in Dunn, Charles W  (ed ) The Presidency in the Twenty-First Century, University Press of Kentucky Tulis, J K  and Macedo, S  (2010) The Limits of Constitutional Democracy, Princeton University Press Tulis, J K  and Macedo, S  (2010) "Constitutional Boundaries," in The Limits of Constitutional Democracy, Princeton University Press Tulis, JK (2010), "The Possibility of Constitutional Statesmanship," in Tulis, JK and Macedo, S (eds ) The Limits of Constitutional Democracy, Princeton University Press Tulis, J  (2009) The Constitutional Presidency  Johns Hopkins University Press Tulis, J  (2009) Impeachment in the Constitutional Order  In J  Tulis & J M  Bessette (Eds ), The Constitutional Presidency  Johns Hopkins University Press Tulis, J  & Bessette, J M  (2009) On the Constitution, Politics, and the Presidency  In J  Tulis & J M  Bessette (Eds ), The Constitutional Presidency  Johns Hopkins University Press Tulis, J (and Bessette, J M) (2010) The Presidency in the Constitutional Order: Historical Perspectives, Reissued Classics Series, Transaction Publishers,Tulis, J and Bessette, J M  (2010, "Introduction to the Transaction Edition," The Presidency in the Constitutional Order: Historical Perspectives, Transaction Publishers 
Tulis, JK, (2009) "The Two Constitutional Presidencies," in Nelson, Michael (ed ) The Presidency in the Political System, Congressional Quarterly Press Tulis, J  & Mellow, N  (2007) Andrew Johnson and the Politics of Failure  In S  Skowronek & M  Glassman (Eds ), Formative Acts: Reckoning with Agency in American Politics  Philadelphia: University of Pennsylvania Press Tulis, J  (2007, September) The Rhetorical Presidency in Retrospect  Critical Review: An Interdisciplinary Journal of Politics and Society, 19(2&3)  Curriculum Vitae



ground_truth: In 2009, Brooksley Born received the John F. Kennedy Profiles in Courage Award.