Incremental GSC parsing (exact copy of the tutorials shared as a separate project) / __pycache__ / gsc.cpython-35.pyc
1576 views
�r'Xyu �
@ s� d d l Z d d l Z d d l Z d d l Z d d l Z d d l m Z d d l Z d d l
Z
d d l m Z d d l
j Z d Z Gd d � d e � Z Gd d � d e � Z Gd d
� d
e � Z Gd d � d e � Z d
d d d d � Z d d d � Z d d d d d d d d d d d d d � Z d d d � Z d d � Z d d � Z d d � Z d d! � Z d d d" d# � Z d$ d% � Z d& d' � Z d( d) � Z! d* d+ � Z" d, d- � Z# d. d/ � Z$ d S)0� N)�linalg)� OrderedDictg333333�?c @ s� e Z d Z d Z d d d � Z d d � Z d d � Z d d
� Z d d � Z d
d � Z d d � Z
d d � Z d d � Z d d � Z
d d � Z d d � Z d d � Z d d � Z d d � Z d! d" � Z d# S)$�Fillersz
Tc C se d } t j | � | _ | j � | rD | | _ | j j | � n d | _ | j � | j � d S)N�_) �grammar�Grammar�g�_get_filler_names�null�names�append�_construct_treelets�_construct_pairs)�self�cfg�add_null� null_filler� r �5/projects/18c77389-a5c3-49de-946a-7593b53d3fb2/gsc.py�__init__ s
zFillers.__init__c C s{ | j j } g } x= | D]5 } | j | � x | | D] } | j | � q7 Wq Wt t | � � } | j � | | _ d S)N)r �hnfRulesr �extend�list�set�sortr )r � hnf_rules�fillers�key�itemr r r r ! s
zFillers._get_filler_namesc C s� | j j } g } x� | j � D]� } | | } x| | D]t } t | � d k r6 | j | d � r6 | | d g } | | d } x | D] } | j | � q� W| j | � q6 Wq W| | _ d S)N� r )r r �keys�len� is_bracketedr r �treelets) r r Ztreelet_fillers�lhs�rhs�sym� curr_treeletZrhs_newZsym_newr r r r
. s
%
zFillers._construct_treeletsc C s� g | _ x� | j D]� } | j j | d | d g d g � t | � d } xJ t | � D]< } | j j | d | | d g d | d | f g � qZ Wq Wd S)Nr r �1_of_1� z%d_of_%d)�pairsr# r r! �range)r �treelet� n_daughters�iir r r r C s $ zFillers._construct_pairsc C s d S)Nr r )r �fillerr r r �findO s z Fillers.findc C s d S)Nr r )r r/ r r r � find_mothersR s zFillers.find_mothersc C s d S)Nr r )r r/ r r r �find_daughtersU s zFillers.find_daughtersc C sO t j d � } g } x3 | j D]( } | j | � d k r | j | � q W| S)z)Return a list of bracketed filler symbolsz
.*\[[0-9]+\]$N)�re�compiler �matchr )r �pattern�fillers_bracketedr/ r r r �subset_bracketedX s zFillers.subset_bracketedc s � f d d � � j D� } | S)z)Return a list of bracketed filler symbolsc s( g | ] } | � j � k r | � q Sr )r8 )�.0r/ )r r r �
<listcomp>c s z.Fillers.subset_unbracketed.<locals>.<listcomp>)r )r Zfillers_unbracketedr )r r �subset_unbracketeda s zFillers.subset_unbracketedc C s | j j | j j � S)N)r � getRootNoder )r r r r � subset_rootg s zFillers.subset_rootc C s | j j | j j � S)N)r �getTerminalNodesr )r r r r �subset_terminalsj s zFillers.subset_terminalsc C s | | j � k S)N)r? )r r/ r r r � is_terminalm s zFillers.is_terminalc C s | | j � k S)N)r8 )r r/ r r r r" p s zFillers.is_bracketedc C s | | j � k S)N)r; )r r/ r r r �is_unbracketeds s zFillers.is_unbracketedc C s | | j � k S)N)r= )r r/ r r r �is_rootv s zFillers.is_rootc C sc x\ t | j � D]K \ } } | d d | d d d j | d d � � d } t | � q Wd S)Nr z ( r � r) z ) ))� enumerater# �join�print)r r. r, �tempr r r �
read_treeletsy s 5zFillers.read_treeletsN)�__name__�
__module__� __qualname__�__doc__r r r
r r0 r1 r2 r8 r; r= r? r@ r" rA rB rH r r r r r s"
r c @ s e Z d Z d d d � Z d d � Z d d � Z d d � Z d
d � Z d d
� Z d d � Z d d � Z
d d � Z d d � Z d d � Z
d d � Z d d � Z d d � Z d d � Z d d! � Z d" d# � Z d$ d% � Z d& d' � Z d( d) � Z d* S)+� SpanRolesr) c C se | | _ | | _ d | _ | j � | j � | j � | j � | j � | j � | j � d S)z Construct a SpanRole object.FN)
� max_sent_len�max_num_branch� use_terminal� _generate�_sort�_name�_graph�_check_overlapr
r )r rN rO r r r r � s
zSpanRoles.__init__c C s� g } xD t | j � D]3 } | t t j t | j d � | d � � 7} q W| j r� g } xE | D]= } | j | � d k rc | j | d | d | d f � qc W| | } | | _ t
| � | _ d S)Nr r) r ) r+ rO r � itertools� combinationsrN rP � get_widthr �rolesr! � num_roles)r rY �
num_branchZroles_terminal�roler r r rQ � s %
&
zSpanRoles._generatec C su g } x= | D]5 } | j | | j | � | j | � | d f � q
Wt | d d d � �} d d � | D� } | S)Nr r c S s | d | d | d f S)Nr r) � r )�xr r r �<lambda> s z&SpanRoles.sort_roles.<locals>.<lambda>c S s g | ] } | d � q S)r r )r9 Zrole_augmentedr r r r: s z(SpanRoles.sort_roles.<locals>.<listcomp>)r rX �get_num_branch�sorted)r Z roles_tupleZroles_augmentedr\ Zroles_tuple_sortedr r r �
sort_roles
s
zSpanRoles.sort_rolesc C s | j | j � | _ d S)N)rb rY )r r r r rR s zSpanRoles._sortc C s= g } x' | j D] } | j | j | � � q W| | _ d S)N)rY r � tuple2strr )r �
role_namesr\ r r r rS ! s zSpanRoles._namec
s� i } t | � } x7 � j D], } i | | <g | | d <g | | d <q WxU� j D]J} � j | � } � j | � r:� j | � } � j | � } � j | � } � f d d � | D� } | | d j | g � | | d j | g � | | d j | � x2 t | � D]$ \ } } | | d j | g � qW� j rV � j
| � rV � j | � } � j | � } | | d j | g � | | d j | g � qV W| � _ d S)N�m�dc s4 g | ]* } � j | � d k r � j | � � q S)r )rX rc )r9 rf )r r r r: 7 s z$SpanRoles._graph.<locals>.<listcomp>) r r rY rc r" � _find_mother�_find_daughterr rD rP r@ �G)
r ri �role_str�
role_tupleZ mother_tupleZ
mother_strZdaughter_tupleZ daughter_strr. rf r )r r rT ' s0
zSpanRoles._graphc s� g } x� � j D]� } � j � j | � � s � j | d } t | � d k r� � f d d � | D� } t | � d k r� | j | � | j | g � q Wt | d � f d d � �} | � _ d S)Nrf r c s6 g | ], } � j � j | d � � s | d � q S)r )r@ � str2tuple)r9 rf )r r r r: U s z,SpanRoles._check_overlap.<locals>.<listcomp>r c sK � j � j | d � � � j � j | d � � � j | d � d f S)Nr )rX rl r` )r^ )r r r r_ ^ s z*SpanRoles._check_overlap.<locals>.<lambda>)ri r" rl r! r ra �
quant_list)r rm � role_nameZ daughters�dsr )r r rU G s
zSpanRoles._check_overlapc C s� g } x� | j D]� } | j | � } | j | � r g } | j | d } t | � d k rj t j d � | j | d � | j | � | j | d } | j | d � | j | � q W| | _ d S)Nre r zCHECK!!!r rf ) ri rl r" r! �sys�exitr r r# )r Z
treelet_rolesrj rk r' ZmlistZdlistr r r r
d s
z SpanRoles._construct_treeletsc C s� g | _ x� | j D]� } | j j | d | d g d g � t | � d } xJ t | � D]< } | j j | d | | d g d | d | f g � qZ Wq Wd S)Nr r r( r) z%d_of_%d)r* r# r r! r+ )r r, r- r. r r r r ~ s $ zSpanRoles._construct_pairsc C sO | j | � r! | d | d f S| j rK | j | � rK | d | d f Sd S)Nr r �����rr )r" rP r@ )r �role_tuple_bracketedr r r rg � s zSpanRoles._find_motherc s: | j � � r6 � f d d � t t � � d � D� Sd S)Nc s( g | ] } � | � | d f � q S)r r )r9 r. )rs r r r: � s z,SpanRoles._find_daughter.<locals>.<listcomp>r )r" r+ r! )r rs r )rs r rh � s zSpanRoles._find_daughterc C s* t d d � | d d � j d � D� � S)Nc S s g | ] } t | � � q Sr )�int)r9 �posr r r r: � s z'SpanRoles.str2tuple.<locals>.<listcomp>r �,rr )�tuple�split)r rj r r r rl � s zSpanRoles.str2tuplec C s t | � j d d � S)NrC � )�str�replace)r rk r r r rc � s zSpanRoles.tuple2strc C s | d | d S)Nr r rr r )r rk r r r rX � s zSpanRoles.get_widthc C s t | � d S)Nr )r! )r rk r r r r` � s zSpanRoles.get_num_branchc C s( | j | � d k o' | j | � d k S)Nr )r` rX )r rk r r r r" � s zSpanRoles.is_bracketedc C s] | j r1 | j | � d k o0 | j | � d k S| j | � d k oX | j | � d k Sd S)Nr r) )rP rX r` )r rk r r r r@ � s
zSpanRoles.is_terminalc s � f d d � � j D� S)z'Return a list of terminal roles (tuple)c s% g | ] } � j | � r | � q Sr )r@ )r9 �r)r r r r: � s z.SpanRoles.subset_terminals.<locals>.<listcomp>)rY )r r )r r r? � s zSpanRoles.subset_terminalsc s � f d d � � j D� S)z'Return a list of terminal roles (tuple)c s% g | ] } � j | � r | � q Sr )r" )r9 r| )r r r r: � s z.SpanRoles.subset_bracketed.<locals>.<listcomp>)rY )r r )r r r8 � s zSpanRoles.subset_bracketedc C sc x\ t | j � D]K \ } } | d d | d d d j | d d � � d } t | � q Wd S)Nr z ( r rC r) z ) ))rD r# rE rF )r r. r, rG r r r rH � s 5zSpanRoles.read_treeletsN)rI rJ rK r rQ rb rR rS rT rU r
r rg rh rl rc rX r` r" r@ r? r8 rH r r r r rM � s( rM c @ s e Z d Z d Z d d d d d d d d d
� Z d d d
� Z d d d � Z d d � Z d d � Z d d � Z d d d � Z
d d d � Z d d � Z d d � Z
d d � Z d! d" � Z d# d$ � Z d% d& � Z d' d( � Z d) d* � Z d+ d, � Z d- d. � Z d/ S)0�HarmonicGrammara� Construct an object implementing a Harmonic Grammar
[ [['S[1]/(0,1,2)', 'A/(0,1)'], 2.], # H(S[1]/(0,1,2), A/(0,1)) = 2
[['S/(0,2)', 'S[1]/(0,1,2)'], 2.],
[['A/(0,1)'], -1.], # H(A/(0,1)) = -1
...
... # For parsimony,
[['A'], -1.], # H(A/r) = -1 for all r in R, a set of roles
[['(0,1,2)'], -3.] # H(f/(0,1,2)) = -3 for all f in F, a set of fillers
...]
� span_roleT�pair�
impossibleg Fr/ c
C s+ | | _ | | _ g | _ d | _ d | _ d | _ d | _ d | _ d | _ | | _ t
j | � | _
t | d | �| _
| j
j | _ | d k r� t d | d | j � | _ | j j | _ | j � | j | � | j � | j � | j d | � | j d | � | r'| j d
| � d S)
Nr) g $@�
r r~ rN rO r5 �which�penalizeg $�i����)� role_type�size�rules� filler_namesrd �
binding_namesr[ �bias_constraint�unused_binding_harmony� null_biasr r r r r rM rY �_set_binding_namesr
r �_convert_tuple_to_str�_add_rules_binary�_add_rules_unary�_add_constraints)
r r r� r� r r5 r� r� �add_constraintZ
unary_baser r r r � s2
zHarmonicGrammar.__init__�unusedc s4 | d k r� g � x( | j D] } � f d d � | D� q Wx�| j D]G } | � k rG | j d � d d k rG | j j | g | j g � qG Wn�| d k r0x�| j D]�} | j d � \ } } | j j | � } | | j j k r� | | j j
� k r3| | j j
� k r,| j j | g | j g � q� | j j | � r�| | j j
� k so| | j j
� k r,| j j | g | j g � q� | | j � k r�| | j j
� k s�| | j j
� k r,| j j | g | j g � q� | | j � k r� | | j j
� k r� | j j | g | j g � q� Wd S)Nr� c s g | ] } � j | � � q Sr )r )r9 �binding)�
bindings_usedr r r: s z4HarmonicGrammar._add_constraints.<locals>.<listcomp>�/r r r� )r# r� rx r� r r� rY rl r r
r? r� rB r8 �get_bracketed_fillers)r r� r, r� �b�fr| Zr_tupler )r� r r� s8 z HarmonicGrammar._add_constraintsr� c s) � � f d d � � j j D� � _ d S)Nc s1 g | ]' } � j j D] } | � | � q q Sr )r r )r9 r| r� )r �sepr r r: E s z6HarmonicGrammar._set_binding_names.<locals>.<listcomp>)rY r r� )r r� r )r r� r r� C s z"HarmonicGrammar._set_binding_namesc C sk | j � } | j � } | j j d k r9 | j j } n d } g } x| j j D]} x� | j j D]� } t | � t | � k re t t | | � � } | rId } x� t t | � � D]l }
| |
d | k } | |
d | k } | |
d | k }
| r| s| r| s|
r� | d 7} q� W| t | � k rV| j
| � qe | j
| � qe WqR W| | _ d S)Nr r ) �get_terminal_fillers�get_terminal_rolesr r
r# rY r! r �zipr+ r )r r� �terminal_fillersZterminal_rolesr Ztreelet_bindingsZ treelet_fZ treelet_rZ treelet_b�countZ
binding_indexZ
is_terminal_fZ
is_terminal_rZ is_null_fr r r r
H s4 z#HarmonicGrammar._construct_treeletsc C sy g } xc | j j D]U } xL | j j D]> } | d | d k r& | j t t | d | d � � � q& Wq W| | _ d S)Nr r )r r* rY r r r� )r Z
pair_bindingsZpair_fZpair_rr r r r k s ,z HarmonicGrammar._construct_pairsc C s� x[ t | j � D]J \ } } x; t | � D]- \ } } | d d | d | j | | <q) Wq Wx[ t | j � D]J \ } } x; t | � D]- \ } } | d d | d | j | | <q� Wqn Wd S)Nr r� r )rD r# r* )r r. r, �jjr� r r r r r� u s ) z%HarmonicGrammar._convert_tuple_to_strc C s� | d k r� x� | j D]s } | j j | d | d g d g � xF t t | � d � D]. } | j j | d | | d g d g � qW Wq WnD | d k r� x5 | j D]* } | j j | d | d g d g � q� Wd S)zAdd binary HG rulesr, r r g @r) r N)r# r� r r+ r! r* )r r5 r, r. r r r r r� s $ 3 z!HarmonicGrammar._add_rules_binaryc C s xt | j j � D]� \ } } | | j j � k rW | j j | g d | j g � q | | j j � k r� | j j | g d g � q | | j j � k r� | j j | g d g � q | | j j k r� | j j | g | j
g � q | j j | g d g � q Wd S)zAdd unary HG rulesg �?g @Ng �g �g �g �) rD r r r8 r� r r[ r? r= r
r� )r r� r. r/ r r r r� � s # z HarmonicGrammar._add_rules_unaryc C s\ t d � xY | j D]N } t | d � d k r t d | d d d | d d d | d � q Wt d � x� | j D]� } t | d � d k rz | d d | j j k r� t d | d d d | d � qz | d d | j j k rt d
| d d d | d � qz | d d | j k rPt d | d d d | d � qz d Sqz Wd S) NzBinary rules:
r r) zH(z, r z) = %.1fz
Unary rules:
z
/*) = %.1fzH(*/)rF r� r! r r rY r� )r �ruler r r �
read_rules6 s
6
%%%zHarmonicGrammar.read_rulesc C s^ | j j | j j � } t | t � s0 | g } x' | D] } | j j | g d g � q7 Wd S)Ng �?r g �)r r< r �
isinstancer r� r )r Z root_fillersr/ r r r �_add_rules_rootK s
z HarmonicGrammar._add_rules_rootc C s | j j d k r7 | j j | k r7 | j | j j � t | j j � t | � k rd | | j _ n
t j d � | j � d S)NzgThe set of filler names constructued ffrom grammar is not same as the set of filler names you provided.)r r
r r r rp rq r� )r Zfillers_orderedr r r �reorder_fillers� s
z HarmonicGrammar.reorder_fillersc C s d S)Nr r )r r r r �
get_binary� s zHarmonicGrammar.get_binaryc C s d S)Nr r )r r r r � get_unary� s zHarmonicGrammar.get_unaryc C s d S)Nr r )r r r r r � s zHarmonicGrammar.sortc C s& | j j | j j � } | j � | S)N)r r> r r )r r� r r r r� � s
z$HarmonicGrammar.get_terminal_fillersc C sX t j d � } g } x< | j j j � D]( } | j | � d k r( | j | � q( W| S)z)Return a list of bracketed filler symbolsz
.*\[[0-9]+\]$N)r3 r4 r r r r5 r )r r6 r7 r r r r r� � s z%HarmonicGrammar.get_bracketed_fillersc C s d d � | j j � D� S)Nc S s( g | ] } t | � j d d � � q S)rC ry )rz r{ )r9 r\ r r r r: � s z6HarmonicGrammar.get_terminal_roles.<locals>.<listcomp>)rY r? )r r r r r� � s z"HarmonicGrammar.get_terminal_rolesc C s d d � | j j � D� S)Nc S s( g | ] } t | � j d d � � q S)rC ry )rz r{ )r9 r\ r r r r: � s z7HarmonicGrammar.get_bracketed_roles.<locals>.<listcomp>)rY r8 )r r r r �get_bracketed_roles� s z#HarmonicGrammar.get_bracketed_rolesN)rI rJ rK rL r r� r� r
r r� r� r� r� r� r� r� r� r r� r� r� r� r r r r r} � s* K/ #
� t
r} c @ s� e Z d Z d d d d d d � Z d d � Z d d � Z d d � Z d
d � Z d d
� Z d d � Z d d � Z
d d � Z d d � Z d d � Z
d d � Z d d � Z d d d � Z d d � Z d d! d" � Z d d# d$ � Z d% d& � Z d' d( � Z d) d* � Z d+ d, � Z d- d. � Z d/ d0 � Z d d1 d2 � Z d d3 d4 � Z d d5 d6 � Z d7 d8 d9 � Z d: d d; d< � Z d d= d> � Z d d d d? d@ � Z dA dB dC � Z! dD dE � Z" d dF dG � Z# d dH dI � Z$ d dJ dK � Z% d dL dM � Z& d dN dO � Z' d dP dQ � Z( d dR dS � Z) d dT dU � Z* d dV dW � Z+ d d dX dY � Z, d d dZ d[ � Z- d d\ d] � Z. d d^ d_ � Z/ d d` da � Z0 d db dc � Z1 d dd de � Z2 d df dg � Z3 d dh di � Z4 d dj dk � Z5 d dl dm � Z6 d d dn do � Z7 d d dp dq � Z8 dr ds � Z9 dt du � Z: dv dw � Z; dx dy � Z< dz d{ d| d} � Z= d~ d � Z> d d� d� � Z? d{ d� d� � Z@ d� d� � ZA d� d� � ZB dz d� d� � ZC d� d� d� d� � ZD d� d� d� d� � ZE d d d d� d{ d d� d{ d d� d� � ZF d d d� d� � ZG d� d� � ZH d� d� � ZI d� d� � ZJ d� d� � ZK d� d� � ZL d� d� d� � ZM d d d� d d d d� d� � ZN d� d� � ZO d S)��GscNetNc C s� | j � | j d | � | j � | j d | � | d k rM | j | � | | _ | | _ | j � | j � | j � t
j | j | j f � | _
t
j | j � | _ | d k r� | j | � | j � | j � | j � t
j | j � | _ t
j | j � | _ | j � | _ | j d | j � | _ t
j | j � | _ t
j | j � | _ | j d | j � | _ | j d | j � | _ t | j d t j � r�| j d t
j | j � | _! n | j d | _! | j d d k r| j" � | j d | j d <n
| j# � | j d | _$ | j d | j! � | _% d | _& d | _' d | _( d | _) | j d | _* | j d
| _+ | j d | _, | j- � d S) N�opts� encodings�actC� bowl_center�
bowl_strength�beta_min_offsetr F�q_init�T_init�dt).� _set_opts� _update_opts�_set_encodings�_update_encodings�set_seed�seed�hg�
_add_names�_generate_encodings�_compute_TPmat�np�zeros� num_bindings�WC�bC� _build_model� _set_weights� _set_biases�_set_quant_listr� � actC_prev�C2N�act�act_prev�extC� extC_prev�ext�ext_prevr� r� �numbers�Number�onesr� �"_compute_recommended_bowl_strength�check_bowl_strengthr� �zeta�t�speed� ema_speed�clamped�q�Tr� �reset)r r� r� r� r� r r r r � sX
zGscNet.__init__c C s= g } x' | j D] } | j | j | � � q W| | _ d S)N)rd r �
find_rolesrm )r rm rn r r r r� ; s zGscNet._set_quant_listc C s] i | _ d d d d d d d d d g | j d
<t j | j d <d | j d
<d | j d <d, t j | j d � | j d <d | j d <d | j d <d | j d <d | j d <d | j d <d | j d <d | j d <d | j d <d | j d <d | j d! <d | j d" <d# | j d$ <d# | j d% <d# | j d& <d' | j d( <d) | j d* <d | j d+ <d S)-z'Set option variables to default values.r� �H�H0�Qr� r� r� r� r� �trace_varnames�norm_ord�N�coordg����MbP?�
ema_factorr �ema_taur� g �T_min� T_decay_rater� g i@�q_maxg $@�q_rateg �?�cr� Nr� g�������?r� r� T�H0_on�H1_on�Hq_ong{�G�z�?�max_dtg����Mb@?�min_dt�q_policyrr )r� r� �inf�log)r r r r r� A s. (
!
zGscNet._set_optsc C s� | d k r� x� | D]� } | | j k r� | | | j | <| d k rf d t j | j | � | j d <| d k r� t j d | j | � | j d <q t j d � q Wd S)z Update option variable valuesNr� r r� z Check [opts]rr rr )r� r� r� �exprp rq )r r� r r r r r� ] s
! $zGscNet._update_optsc C s� i | _ d | j d <d | j d <d | j d <d | j d <d | j d <d | j d <d | j d
<d | j d <d | j d <d | j d
<d | j d <d S)z)Set encoding variables to default values.g �dp_f�dp_r�dist�coord_f�coord_rN�dim_f�dim_rr� rd �F�R�
similarity)r� )r r r r r� k s
zGscNet._set_encodingsc C sA | d k r= x. | D]& } | | j k r | | | j | <q Wd S)zUpdate encoding variablesN)r� )r r� r r r r r� { s
zGscNet._update_encodingsc s � j d k r� � j d d k r/ t j d � � j d d k rO t j d � � j d � _ � j d � _ � f d d � � j D� � _ nU t � j t � r� � j j j
� _ � j j j
� _ � j j � _ n
t j d � t � j � � _
t � j � � _ t � j � � _ d S) z8Add filler, role, and binding names to the GscNet objectNr� z&Please provide a list of filler names.rd z$Please provide a list of role names.c s. g | ]$ } � j D] } | d | � q q S)r� )r� )r9 r| r� )r r r r: � s z%GscNet._add_names.<locals>.<listcomp>z1[hg] is not an instance of HarmonicGrammar class.)r� r� rp rq r� rd r� r� r} r r rY r! � num_fillersrZ r� )r r )r r r� � s
"
zGscNet._add_namesc s� � j d d k r�t j t j � j � � } t j t j � j � � } x^� j d D]O} t � f d d � | d D� � r� | d | � j j | d d � � j j | d d � f <| d | � j j | d d � � j j | d d � f <qW t � f d d � | d D� � r�| d | � j j | d d � � j j | d d � f <| d | � j j | d d � � j j | d d � f <qW t
j d � qW W| � j d <| � j d
<t � j d � j d d
� j d d � j d �� _
t � j d � j d d
� j d
d � j d �� _ � j d d k rY� j d � _
� j d d k r|� j d � _ � j
j d � _ � j j d � _ � j � j � _ t t � j � � � � f d d � t t � j � � D� � _ d S)z?Generate vector encodings of fillers, roles, and their bindingsr� Nc 3 s | ] } | � j k Vq d S)N)r� )r9 r& )r r r � <genexpr>� s z-GscNet._generate_encodings.<locals>.<genexpr>r r c 3 s | ] } | � j k Vq d S)N)rd )r9 r& )r r r r� � s z6Cannot find some f/r bindings in your similarity list.r� r� r� r� �dp�dimr� r� r� r� r� c s- g | ]# } d t | d � j � � � q S)�Ur )rz �zfill)r9 r. )�ndigitsr r r: � s z.GscNet._generate_encodings.<locals>.<listcomp>)r� r� �diagr� r� rZ �allr� �indexrd rp rq �encode_symbolsr� r� �shaper� r� � num_unitsr! rz r r+ �
unit_names)r r� r� r� r )r r r r� � s@ #<?#<?
zGscNet._generate_encodingsc C sn t | t � r/x*| j D]} t | d � d k r_ | j | d d | d d | d � q t | d � d k r| d d | j k r� | j | d d | d � q(| d d | j k r� | j | d d | d � q(| d d | j k r(| j
| d d | d � q t j d | � q Wn
t j d � t
j | j | j j � d k rjt j d � d S) zCSet the weight and bias values using a HarmonicGrammar object [hg].r r) r z(Check the rule in your Harmonic Grammar:zDThe given grammar as hg is not an instance of HarmonicGrammar class.Fz?The weight matrix (2D array) is not symmetric. Please check it.N)r� r} r� r! �
set_weightr� �set_biasr� �set_filler_biasrd �
set_role_biasrp rq r� �allclose�Wr� )r r� r� r r r r� � s *
!zGscNet._build_modelc C s� t j | j | j � } | j d | j d k rD t j | � } n t j | � } | | _ | | _ | j j
j | j � | _ d S)zuCompute the matrices of change of basis from conceptual to neural and from neural to conceptual coordinates.
r r N)
r� �kronr� r� r r �inv�pinv�TP�TPinvr� �dot�Gc)r r r r r r r� � s zGscNet._compute_TPmatc C s+ | j j j | j � j | j � | _ d S)zJCompute the weight values in the neural space (distributed representation)N)r r� r r� r )r r r r r� � s zGscNet._set_weightsc C s | j j j | j � | _ d S)zHCompute the bias values in the neural space (distributed representation)N)r r� r r� r� )r r r r r� � s zGscNet._set_biasesc C s� t j j | j � \ } } t | � } t j t | j � � d k r� | j d k r� | j | j
| j } | j | j
| d | j } nC t | j | j
| j � } t | j | j
| d | j � } t | | | � } n | } | S)z^Compute the recommended value of bowl strength. Note that the value depends on external input.r r ) r� r �eighr� �max�sum�absr� r� r� r� �min)r �eigvalsZeigvecsZeig_maxZbeta1Zbeta2�valr r r r� � s " %z)GscNet._compute_recommended_bowl_strengthTc C sU | j � } | j d | k r0 t j d | � | rQ t d | j d | f � d S)zaCompute and print the recommended beta value
given the weights and biases in the C-space.r� z*Bowl strength should be greater than %.4f.zB(Current bowl strength: %.3f) must be greater than (minimum: %.3f)N)r� r� rp rq rF )r �dispZbeta_minr r r r� s
zGscNet.check_bowl_strengthc C s� t | t j � p! t | t j � s1 t j d � t | t j � rY | t j | j � } | j d | j k r| t j d � | | _
| j d | j
� | _ d S)a� Update the bowl center
Usage:
>>> net.update_bowl_center(0.3) # Set the bowl center to 0.3 * ec{1}
>>>
>>> import numpy as np
>>> bowl_center = np.random.random(net.num_bindings)
>>> net.update_bowl_center(bowl_center)
: bowl_center: float or 1d NumPy array (size=number of bindings). the bowl center.
z:You must provide a scalar or a NumPy array as bowl_center.r zvWhen you provide a NumPy array as bowl_center, it must have the same number of elements as the number of f/r bindings.r� N)
r� r� �ndarrayr� r� rp rq r� r� r r� r� r� )r r� r r r �update_bowl_center s $
zGscNet.update_bowl_centerc C sN | d k r- | j � | j d | j d <n
| | j d <| j d | _ d S)a0 Replace the current bowl strength with
the recommended bowl strength (+ offset)
Usage:
>>> net = gsc.GscNet(...)
>>> net.set_weight('a/(0,1)', 'b/(1,2)', 2.0)
>>> net.update_bowl_strength()
: bowl_strength : float or None (=default)
Nr� r� )r� r� r� )r r� r r r �update_bowl_strength0 s
zGscNet.update_bowl_strengthc C sl | j | � } | j | � } | rK | | j | | f <| j | | f <n | | j | | f <| j � d S)z�Set the weight of a connection between binding1 and binding2.
When symmetric is set to True (default), the connection weight from
binding2 to binding1 is set to the same value.N)�
find_bindingsr� r� )r Z
binding_name1Z
binding_name2�weight� symmetric�idx1Zidx2r r r r
E s 'zGscNet.set_weightc C s* | j | � } | | j | <| j � d S)z+Set bias values of [binding_name] to [bias]N)r" r� r� )r Z binding_name�bias�idxr r r r R s
zGscNet.set_biasc s� d d � | j D� } t | t � s. | g } xF t | � D]8 \ } � � f d d � t | � D� } | | j | <q; W| j � d S)zPSet the bias of bindings of all roles
with particular fillers to [bias].c S s# g | ] } | j d � d � q S)r� r )rx )r9 �bbr r r r: ] s z*GscNet.set_filler_bias.<locals>.<listcomp>c s( g | ] \ } } � | k r | � q Sr r )r9 r. �ff)r/ r r r: a s N)r� r� r rD r� r� )r � filler_namer& � filler_listr� r' r )r/ r r Y s zGscNet.set_filler_biasc s� d d � | j D� } t | t � s. | g } xF t | � D]8 \ } � � f d d � t | � D� } | | j | <q; W| j � d S)zPSet the bias of bindings of all fillers
with particular roles to [bias].c S s# g | ] } | j d � d � q S)r� r )rx )r9 r( r r r r: j s z(GscNet.set_role_bias.<locals>.<listcomp>c s( g | ] \ } } � | k r | � q Sr r )r9 r. �rr)r\ r r r: n s N)r� r� r rD r� r� )r rn r& � role_listr� r' r )r\ r r
f s zGscNet.set_role_biasc s/ t | t � s | g } � f d d � | D� S)z@Find the indices of the bindings from the list of binding names.c s" g | ] } � j j | � � q Sr )r� r )r9 r( )r r r r: ~ s z(GscNet.find_bindings.<locals>.<listcomp>)r� r )r r� r )r r r" y s zGscNet.find_bindingsc s~ t | t � s | g } d d � | j D� } g } xC t | � D]5 \ } � � f d d � t | � D� } | | 7} qA W| S)Nc S s# g | ] } | j d � d � q S)r� r )rx )r9 r( r r r r: � s z'GscNet.find_fillers.<locals>.<listcomp>c s( g | ] \ } } � | k r | � q Sr r )r9 r. r) )r/ r r r: � s )r� r r� rD )r r* r+ Z
filler_idxr� r' r )r/ r � find_fillers� s zGscNet.find_fillersc s~ t | t � s | g } d d � | j D� } g } xC t | � D]5 \ } � � f d d � t | � D� } | | 7} qA W| S)Nc S s# g | ] } | j d � d � q S)r� r )rx )r9 r( r r r r: � s z%GscNet.find_roles.<locals>.<listcomp>c s( g | ] \ } } � | k r | � q Sr r )r9 r. r, )r\ r r r: � s )r� r r� rD )r rn r- Zrole_idxr� r' r )r\ r r� � s zGscNet.find_rolesc C s4 | d k r | j � } | j | j | j d d �S)z�Convert an activation state vector to a matrix form
in which each row corresponds to a filler
and each column corresponds to a role.N�orderr� )ZS2C�reshaper� rZ )r r� r r r �vec2mat� s zGscNet.vec2matc C s% | d k r | j } | j j | � S)z6Change basis: from conceptual/pattern to neural space.N)r� r r )r r� r r r r� � s z
GscNet.C2Nc C s% | d k r | j } | j j | � S)z6Change basis: from neural to conceptual/pattern space.N)r� r r )r r� r r r �N2C� s z
GscNet.N2Cr� c C ss | d d k rA t t j t | | � d | j d | j �� n. t t j t | | � d | j d | j �� d S)zQPrint the weight matrix in a readable format
(in the pattern coordinate).r �Cr �columnsNrr )rF �pd� DataFrame�getattrr� r )r r� r r r � read_weight� s zGscNet.read_weightr� c C s | d d k r� | rV t t j t | | � j | j d � d | j d d g �� qt t j t | | � j d | j � d d g d | j �� n� | r� t t j t | | � j | j d � d | j d d g �� n= t t j t | | � j d | j � d d g d | j �� d S)z2Print the bias vector (in the pattern coordinate).r r3 r r4 r& Nrr )rF r5 r6 r7 r0 r� r� r )r r� Zprint_verticalr r r � read_bias� s zGscNet.read_biasc C sV | d k r | j } | j | j | � � } t t j | d | j d | j �� d S)z[Print the current state (C-SPACE) in a readable format.
Pandas should be installed.Nr r4 )r� r1 r2 rF r5 r6 r� rd )r r� r� r r r �
read_state� s
zGscNet.read_statec s� d � | d k r � j } � j � j | � � � t j � d d �} � f d d � | D� � d d � t � � j � D� � | r� � � � f d d � t | � D� } � f d d � | D� � | r� t � � � S)
z�Print a grid point close to the current state. The grid point will be
chosen by the snap-it method: a filler with the highest activation
value in each role will be chosen.g �?N�axisr c s g | ] } � j | � q Sr )r� )r9 r. )r r r r: � s z*GscNet.read_grid_point.<locals>.<listcomp>c S s g | ] } d | � q S)z%s/%sr )r9 r( r r r r: � s c sN g | ]D \ } } � | | f � k r � j | � j j j k r | � q Sr )r� r� r r
)r9 Zrole_numZ
filler_num)r� �act_minr r r r: � s c s g | ] } � | � q Sr r )r9 r| )�winnersr r r: � s ) r� r1 r2 r� �argmaxr� rd rD rF )r r� r �skipZ
winner_idxrY r )r� r< r r= r �read_grid_point� s %
zGscNet.read_grid_pointg �cAc
s/ � j � j d k r1 t j d � j � j � � j � j | k rW � j � j } d g � j } xC t � j � D]2 \ } } � f d d � � j | � D� | | <qw Wg � t j | � } � j � j d k r� t d � j � j � x� t t
j | � � D]� \ } } | d d d
k r\t d | d d d
�| d d d
k r\t d
� t | � } � j
| � � j � } | | k r�| | | <� j | � q| t j | � k r| � t j | � <| | t j | � <qWt j | � d d d � } � f d d � | D� � _ | | � _ d S)a� Get a list of the top [n] grid points with high harmony values
and compute H_0 at every grid point. Regardless of the [n] value,
the program will check every grid point. Note that the number of
grid points is [num_fillers]^[num_roles] which increases explosively
as [num_roles] increases. This method works only when the total
number of grid points is reasonably small (currently set to 1e7).g �cAz?There are too many grid points (= %d) to check all grid points.Nc s g | ] } � j | � q Sr )r� )r9 r. )r r r r: s z*GscNet.get_grid_points.<locals>.<listcomp>i' zOf %d grid points: r g ��@r z[%06d]�endry g j�@c s g | ] } � | � q Sr r )r9 r. )�gpsetr r r: $ s rr )r� rZ rp rq rD rd r� r� r� rF rV �productr � set_stater� r r �argmin�argsortrB �gpset_h)
r �nrm Zrindr\ rG r. �gpZhhr' r )rB r r �get_grid_points� s8 *"
zGscNet.get_grid_pointsc C s t j j | � d S)zSet a random number seed.N)r� �randomr� )r �numr r r r� ' s zGscNet.set_seedc C s2 | j | � t | j d � | j | j | � S)zEvalutate total harmonyr� )�Hg�floatr� r� �Qa)r r� r r r r� 7 s zGscNet.Hc C s< t | j d � | j | � t | j d � | j | � S)zEvalutate H_G (= H0 + H1)r� r� )rN r� r� �H1)r r� r r r rM < s z GscNet.Hgc C sI | d k r | j } d | j | j � j | � | j | j j | � S)z Evaluate H0Ng �?)r� r r r� r� )r r� r r r r� B s z GscNet.H0c C sJ | d k r | j } | j d | | j j j | j � j | | j � S)zEvalutate H1 (bowl harmony)Ng �?g �)r� r� r� r� r r )r r� r r r rP I s z GscNet.H1c C s4 | j d | j | � d | j d | j | � S)z5Evaluate quantization harmony Q = c * Q0 + (1-c) * Q1r� r )r� �Q0�Q1)r r� r r r r� Q s zGscNet.Qc C s@ | j d | j | � d | j d | j d | d | j � S)z5Evaluate quantization harmony Q = c * Q0 + (1-c) * Q1r� r r� rm )r� rQ �Q1arm )r r� r r r rO W s z GscNet.Qac C s@ | j d | j | � d | j d | j d | d | j � S)z5Evaluate quantization harmony Q = c * Q0 + (1-c) * Q1r� r r� rm )r� rQ �Q1brm )r r� r r r �Qb\ s z GscNet.Qbc C sB | d k r | j } | j | � } t j | d d | d � S)z Evaluate Q0Nr) r )r� r2 r� r )r r� r� r r r rQ a s z GscNet.Q0c C sP | d k r | j } t j t j | j | j | � � d d d �d d � S)z Evaluate Q1Nr) r; r r )r� r� r r1 r2 )r r� r r r rR i s z GscNet.Q1c C s~ | d k r | j } | d k r* | j } | j | � } d } x7 | D]/ } | | j | | � } | | d d 7} qF W| S)z Evaluate Q1 (sum of squared = 1)Nr r r) )r� rm r2 r )r r� rm r� �q1�qlist�ssqr r r rS p s
z
GscNet.Q1ac C s� | d k r | j } | d k r* | j } | j | � } d } x? | D]7 } | | j | | � } | | d d | d 7} qF W| S)z%Evaluate Q1 (sum of squared = 0 or 1)Nr r r) )r� rm r2 r )r r� rm r� rV rW rX r r r rT � s
z
GscNet.Q1bc C s2 | j | � t | j d � | j | j | � S)z;Compute the harmony gradient evaluated at the current stater� )�HgGradrN r� r� �QaGrad)r r� r r r �HGrad� s z GscNet.HGradc C s< t | j d � | j | � t | j d � | j | � S)z+Compute the gradient of grammar harmony H_Gr� r� )rN r� �H0Grad�H1Grad)r r� r r r rY � s z
GscNet.HgGradc C s3 | d k r | j } | j j | � | j | j S)N)r� r r r� r� )r r� r r r r\ � s z
GscNet.H0Gradc C s@ | d k r | j } | j | j j | � | j j | j � S)N)r� r� r r r� )r r� r r r r] � s z
GscNet.H1Gradc C s4 | j d | j | � d | j d | j | � S)Nr� r )r� �Q0Grad�Q1Grad)r r� r r r �QGrad� s z GscNet.QGradc C s@ | j d | j | � d | j d | j d | d | j � S)Nr� r r� rm )r� r^ �Q1aGradrm )r r� r r r rZ � s z
GscNet.QaGradc C s@ | j d | j | � d | j d | j d | d | j � S)Nr� r r� rm )r� r^ �Q1bGradrm )r r� r r r �QbGrad� s z
GscNet.QbGradc C sY | d k r | j } | j | � } d | d | d d | } t j d | j | � S)Nr) r zij,i)r� r2 r� �einsumr )r r� r� r r r r r^ � s
z
GscNet.Q0Gradc C s� | d k r | j } | j j | j | j | j f d d �} | j | � } | j | � } t j d | d � d } t j d | | � } d
t j d | | � S) z1Compute the gradient of quantization harmony (Q1)Nr/ r� zij->jr) r z
ij,ijk->jk� zj,jk�����)
r� r r0 r� rZ r r2 r1 r� rd )r r� ZTPinv_reshapedr� �amat�term1�term2r r r r_ � s !z
GscNet.Q1Gradc
C s� | d k r | j } | d k r* | j } | j | � } d } xh | D]` } | | } | j | d d � f } | d j � d } t j d | | � } | | | 7} qF Wd | S)z1Compute the gradient of quantization harmony (Q1)Nr r) r zi,ij->jre rf )r� rm r2 r r r� rd )
r r� rm r� �q1gradrW � curr_actC�
curr_TPinv�
curr_term1�
curr_term2r r r ra � s
zGscNet.Q1aGradc C s� | d k r | j } | d k r* | j } | j | � } d } x} | D]u } | | } | j | d d � f } | j | � } | | d d | d } t j d | | � }
| | |
7} qF Wd | S)z1Compute the gradient of quantization harmony (Q1)Nr r r) zi,ij->jre rf )r� rm r2 r r r� rd ) r r� rm r� rj rW rk rl rX rm rn r r r rb � s
zGscNet.Q1bGradc s� | d k r � j d } n_ t | t � s8 t j d � � f d d � | D� } t | � d k r{ t j d � j d � t � d � r� x\ | D] } t � j | � � j | <q� Wn1 i � _ x | D] } g � j | <q� W� j � d S)
zCreate storage for traces.r r� z�Check [trace_list] that should be a list object.
If you want to log a single variable (e.g., H),
you must provide ["H"], not "H", as the value of [trace_list].c s) g | ] } | � j d k r | � q S)r� )r� )r9 �var)r r r r: s z,GscNet.initialize_traces.<locals>.<listcomp>r z�Check [trace_list]. You provided variable name(s) that are not availalbe in the software.
Currently, the following variables are available:
�tracesN) r� r� r rp rq r! �hasattrrp �
update_traces)r �
trace_listZvar_not_in_varnamesr r )r r �initialize_traces s
!
zGscNet.initialize_tracesc C si d | j k r, | j d j t | j � � d | j k rU | j d j | j � � d | j k r~ | j d j | j � � d | j k r� | j d j | j � � d | j k r� | j d j | j � d | j k r� | j d j | j � d | j k r| j d j | j � d | j k r?| j d j | j
� d | j k re| j d j | j � d
S) z
Log tracesr� r� r� r� r� r� r� r� r� N) rp r r r� r� r� r� r� r� r� r� r� )r r r r rr * s$ zGscNet.update_tracesc C s5 x. | j D]# } t j | j | � | j | <q
Wd S)z6Convert list objects of traces to NumPy array objects.N)rp r� �array)r r r r r �finalize_traces@ s zGscNet.finalize_tracesc C s. | j t j | j j | � � � j | j � S)z�Compute a projection matrix of a given matrix A. A is an n x m
matrix of basis (column) vectors of the subspace. This function
works only when the rank of A is equal to the nunmber of columns of A.
)r r r r� )r �Ar r r �_compute_projmatL s zGscNet._compute_projmatg �?Fc s� t | t � s | g } t | t � s0 | g } t | � d k rg t | � t | � k rg t j d � d | _ | | _ t j | j � } | r� d d � | D� } | j
| � } d | | <| j | � � | | � <| | _ | r� � | 7� � j
� � f d d � t j | j � D� } | j d d � | f } t | � d k r^| j | � | _ n t j | j | j f � | _ | j | � | _ | j | j � | _ | j � | _ d S)
z"Clamp f/r bindings to [clamp_vals]r zMThe number of bindings clamped is not equal to the number of values provided.Tc S s# g | ] } | j d � d � q S)r� r )rx )r9 r� r r r r: g s z GscNet.clamp.<locals>.<listcomp>g c s" g | ] } | � k r | � q Sr r )r9 r( )r' r r r: t s Nr )r� r r! rp rq r� �binding_names_clampedr� r� r� r� r" � clampvecCr �aranger rx �projmatr r� �clampvec� act_clampedr� r2 r� ) r r� Z
clamp_valsZ
clamp_comprz rd r% Zidx0rw r )r' r �clampT s8
% z GscNet.clampc C s4 | j d k r0 | ` | ` | ` | ` d | _ d S)ZUnclampTFN)r� r} rz r| ry )r r r r �unclamp~ s zGscNet.unclampc C s, | d k r | j } | j j | � | j S)zXGet a new activation vector after projecting an activation vector
to a subspace.N)r� r| r r} )r r� r r r r~ � s zGscNet.act_clampedc C s� t | t � s | g } t | t � s0 | g } t | � d k rg t | � t | � k rg t j d � | j � | j | � } | | j | <| j | j � | _ d S)zSet external input.r z2binding_names and ext_vals have different lengths.N)
r� r r! rp rq � clear_inputr" r� r� r� )r r� Zext_valsZ
inhib_compr' r r r � set_input� s
zGscNet.set_inputc C s. t j | j � | _ | j | j � | _ d S)zRemove external inputN)r� r� r� r� r� r� )r r r r r� � s zGscNet.clear_inputc C s� | j d | _ | j d | _ d | _ | j � | j � | _ t j | j � | _
| j j | j
� | _
| j � | j � t | d � r� | ` d S)z<Reset the model. q and T will be set to their initial valuesr� r� r rp N)r� r� r� r� �randomize_stater2 r� r� r� r� r� r r r� r� r� rq rp )r r r r r� � s
z GscNet.resetc C sD | j | � } t j | j � | _ | | j | <| j � | _ d S)z�Set state to a particular vector at which the activation values
of the given bindings are set to [vals] (default=1.0)
and the activation values of the other bindings are set to 0.N)r" r� r� r� r� r� r� )r r� �valsr' r r r rD � s
zGscNet.set_stateg �?g�������?c C s: t j j d | d | d | j � | _ | j � | _ d S)zSet initial state�loc�scaler� N)r� rK �normalr� r� r� r� )r �mu�sdr r r �set_init_state� s 'zGscNet.set_init_stater r c C s7 t j j | | | j � | _ | j | j � | _ d S)zgSet the activation state to a random vector
inside a hypercube of [minact, maxact]^num_bindingsN)r� rK �uniformr� r� r� r� )r ZminactZmaxactr r r r� � s zGscNet.randomize_stater r� c C s� d | _ | j | } d | _ | r2 | j | � xe | j | k r� | j d | d | � | rj | j � | d k r5 | j d | d | � | j r5 Pq5 W| j | _ | j | j d d � <| j
j | j � | j d d � <| r� | j
� | r�| r�| j | j d j � j } | j d }
t j |
d |
d |
j d � } g } xG t | j d
� D]2 } | j t j | |
| d d � | f � � qaWt j | � j } t | j d d d
d d d d | j d | d |
d d d
g �d S)z2Run simulations for a given amount of time [time].Fr �update_T�update_qN�tol�testvarr� r� r �xlabel�Time�xtick�ylabelZBindings� yticklabels� grayscale�colorbar� val_rangerr )� convergedr� �steprt �updaterr �check_convergence�rtr� r� r r r� rv r2 rp r� r� �linspacer r+ r �interpru �heatmapr� )r Zdurationr� r� Z log_tracers �plotr� r� r� r� Zt_maxZ
actC_trace�timesZ times_newZactC_trace_new�b_indr r r �run� s@
"
$* z
GscNet.runc C sw | j | j d d � <| j | j d d � <| j � | j � | rc | j d d k rc | j � | rs | j � d S)z8Update state, speed, ema_speed (and optionally T, q, dt)Nr� r ) r� r� r� r� � update_state� update_speedr� r� r� )r r� r� r r r r� s
z
GscNet.updatec C s� | j � } t j | j | � � } | d k rp t | j d | j d | � | _ t | j d | j � | _ | j | j 7_ | j | j | 7_ | j
� | j r� | j � | _ | j
� | _ d S)zUpdate state (with noise)r r� r� N)r[ r� �sqrtr r r� r� r r� r� � add_noiser� r~ r2 r� )r ZgradZgrad_magr r r r� ( s $
zGscNet.update_statec C s= | j t j d | j | j � t j j | j � 7_ d S)z)Add noise to state in neural coordinates.r) N)r� r� r� r� r� rK �randnr )r r r r r� 8 s !zGscNet.add_noisec C sB t j | j d | j � | j | j d | j d | _ d S)zUpdate temperaturer� r� N)r� r� r� r� r� )r r r r r� > s zGscNet.update_Tc C s� | j d d k r_ t j | j | j d d d � d f | j d d d � d f � | _ n7 t t | j | j d | j | j d � d � | _ d S)z Update quantization strengthr� Nr r r� r� )r� r� r� r� r� r r r� )r r r r r� D s
FzGscNet.update_qc C s� | j d d k r& | j | j } n# | j d d k rI | j | j } t j | d | j d �t | j � | _ | j
d k r� | j | _
n9 | j d t | j � } | | j
d | | j | _
d S) zUpdate speed and ema_speedr� r� r3 �ordr� Nr� r ) r� r� r� r� r� r �normr r� r� r� )r �diffZ
ema_weightr r r r� O s &
zGscNet.update_speedc C sO | d k r$ | j | k r$ d | _ | d k rK | j � | k rK d | _ d S)zOCheck if the convergence criterion (distance vs. ema_speed) has been satisfied.r� Tr� N)r� r� r� )r r� r� r r r r� d s zGscNet.check_convergencer3 c
C sq | d k r- | d k r- | j } | j } na | d k rW | d k rW | j | � } n7 | d k r� | d k r� | j | � } n
t j d � | d k r� t | j | � d | j d | j d | d | d | d d
d g �n� | d k rm| j
| j | j f d
d �} d d � t
| j � D� } d d � t
| j � D� } t | d | d | d | d | d | �d S)z?Plot the activation state (conceptual coordinate) in a heatmap.NzEError. You must pass either act or actC but not both to the function.r3 � xticklabelsr� r� r� r r� r r r� r/ r� c S s g | ] } d t | � � q S)r� )rz )r9 r. r r r r: � s z%GscNet.plot_state.<locals>.<listcomp>c S s g | ] } d t | � � q S)r| )rz )r9 r. r r r r: � s )r� r� r� r2 rp rq r� r1 rd r� r0 r� r� r+ )
r r� r� r� r� r r� Zact_matr� r� r r r �
plot_states s(
! zGscNet.plot_statec C s� | j d } | d k rB | j | j | d d � j � j } n
| j | } t j | | � t j d d d �t j | d d �t j d � t j � d S)
z"Plot the trace of a given variabler� r� Nr r� �fontsize� Trr ) rp r2 r� �pltr� r� r� �grid�show)r �varnamer^ �yr r r �
plot_trace� s
)
zGscNet.plot_trace)PrI rJ rK r r� r� r� r� r� r� r� r� r� r� r� r� r� r r! r
r r r
r" r. r� r1 r� r2 r8 r9 r: r@ rJ r� r� rM r� rP r� rO rU rQ rR rS rT r[ rY r\ r] r` rZ rc r^ r_ ra rb rt rr rv rx r r� r~ r� r� r� rD r� r� r� r� r� r� r� r� r� r� r� r� r r r r r� � s� L .
. )
8 r� r� g c C s� | d k r t j | � } n� | d k r3 | } n | | k rL t j d � t | t j � r� | t j | | f � d | t j | | � } t | | | � } | S)a� Generate the vector encodings of [num_symbols] symbols assuming a given similarity structure.
Each column vector will represent a unique symbol.
Usage:
>>> gsc.encode_symbols(2)
>>> gsc.encode_symbols(3, coord='dist', dp=0.3, dim=5)
: num_symbols : int, number of symbols to encode
: coord : string, 'dist' (distributed representation, default) or 'local' (local representation)
: dp : float (0 [default] <= dp <= 1) or 2D-numpy array of pairwise similarity (dot product)
: dim : int, number of dimensions to encode a symbol. must not be smaller than [num_symbols]
:
: [dp] and [dim] values are ignored if coord is set to 'local'.
�localNzHThe [dim] value must be same as or greater than the [num_symbols] value.r ) r� �eyerp rq r� r� r� r� � dot_products)� num_symbolsr� r� r� �sym_matr r r r � s
r i�� c C s> | j | k j � s" t j d � t j | � d k j � rJ t j d � t j j d | | � j | | d d �} d } d } d } x� t
d | d � D]� } | j | j j | � | � } t | d
t
| � j � � }
| |
| } t
| j j | � | � j � } | | k r� d } Pq� W| s:t d | � | S)
a� Generate a 2D numpy array of random numbers such that the pairwise dot
products of column vectors are close to the numbers specified in [dp_mat].
Don Matthias wrote the original script in MATLAB for the LDNet program.
He explains how this program works as follows:
Given square matrix dpMatrix of dimension N-by-N, find N
dim-dimensional unit vectors whose pairwise dot products match
dpMatrix. Results are returned in the columns of M. itns is the
number of iterations of search required, and may be ignored.
Algorithm: Find a matrix M such that M'*M = dpMatrix. This is done
via gradient descent on a cost function that is the square of the
frobenius norm of (M'*M-dpMatrix).
NOTE: It has trouble finding more than about 16 vectors, possibly for
dumb numerical reasons (like stepsize and tolerance), which might be
fixable if necessary.
z&dot_products: dp_mat must be symmetricr z<dot_products: dp_mat must have all ones on the main diagonalr� r/ r� g�������?g�����ư>Fg{�G�z�?Tz#Didn't converge after %d iterations)r� r rp rq r� r �anyrK r� r0 r+ r r r r rF ) r� r� Zdp_matZmax_iterr� Zmin_stepr� r� Ziter_num�incr� �max_diffr r r r� � s(
" r� FTc
C s� | r t j j d � } n t j j d � } | d k ro t j | d | d | d d | d d d d
d �n t j | d | d d d
d �| d k r� t j | d d
�| d k r� t j | d d
�| d k r%| rt j t j t | � � | d d �n t j t j t | � � | � | d k rPt j
t j t | � � | � | d k r�t j d d d d d d d d d d � | d k r�t j d d d d d d d d d d � | r�t j � |
r�t j
� d S) NZgray_r�Reds�cmap�vminr �vmaxr �
interpolation�nearest�aspect�autor� r� �rotation�verticalFr; r^ r� �both�bottom�off�top� labelbottomr� �left�right� labelleft)r� �cm�get_cmap�imshowr� r� �xticksr� r{ r! �yticks� tick_paramsr� r� )
�datar� r� r� r� r� r� Zrotate_xticklabelsr� �ytickr r� r� r r r r� sJ &
r� c
C s� | j d } | j d } d } t j | d | d f � } t j | | � | d d � d d � f <| | d d d � f <| | d d � d f <| d k r� t j � \ } } n t j d | � \ } } x�t | d � D]�} x�t | d � D]�}
| d k r|
d k rq� | d k s+|
d k r4d } n d } | | |
f d k r�t j |
| f | d t j j d t
| | |
f � � d | �} | j | � t j |
| f | d d d d
�} | j | � q� t j |
| f | d d d d
�} | j | � t j |
| f | d d t j j d t
| | |
f � � d | �} | j | � t j |
| f | d d d d d
�} | j | � q� Wq� W| j d | d | | d | | d d | d g � | j
d
d d �| j d � d S)zECompute the outer product of two vectors and present it in a diagram.r g�������?r N�figsize�color�alpha�k�fillFg�������?g333333�?�equal�
adjustable�boxr� )r r� r� �outerr� �subplotsr+ �Circler� �grayr �
add_artistr; �
set_aspect)
Zvec1Zvec2r� �nrow�ncol�radius�arr�fig�axr. r� r� Z curr_unitr r r �plot_TPC sZ
( &
&
r� c C s | | | j S)zGet a binding index.)r� )r� r| �netr r r r� � s r� c C s | | | j S)zGet a unit index.)r� )�phi�rhor� r r r �u_ind� s r� c C s) | j t | | | � t | | | � f S)N)r r� r� )r� r| r� r� r� r r r �w� s r� c C sn d } xa t | j � D]P } xG t | j � D]6 } | t | | | | | � | t | | | � 7} q, Wq W| S)z,Check the activation value of a f/r binding.r )r+ r� r� r� r� )rH r� r� r| r� r� r� r r r �get_a� s
8r� c C s` | d k r� | d k r� t j | j � } xV t | j � D]E } x< t | j � D]+ } t | | | | � | t | | | � <qP Wq: W| S| d k r� | d k r� t j | j � } x0 t | j � D] } t | | | | � | | <q� W| S| d k rI| d k rIt j | j � } x0 t | j � D] } t | | | | � | | <q"W| St | | | | � Sd S)N)r� r� r� r+ r� rZ r� r� )rH r� r� r| Zavecr r r �n2a� s" - r� c C s� d } xu t | j � D]d } x[ t | j � D]J } | t | | d | d | �d d t | | d | d | �d 7} q, Wq W| S)Ng r� r| r) r )r+ r� rZ r� )r� rH Zq0r� r| r r r �Q0E� s
Lr� c
C s� t j | j � } x� t | j � D]� } x� t | j � D]� } d | t | | | � <x� t | j � D]� } xz t | j � D]i } t | | | | � } d | d | d d | } | t | | | � t
| | | | | � | 7<qz Wqd Wq8 Wq" W| S)Ng r) r ) r� r� r r+ r� r� r� r� rZ r� r� ) r� rH �q0gradr� r� r� r| Za_frZg_frr r r �Q0GradE� s )r� c C s� d } xE t | j � D]4 } | t j t | | d | �d � d d 7} q Wt j t j | j t | | � � d d d �d d � S)Ng r| r) r r; r )r+ rZ r� r r� r1 )r� rH rV r| r r r �Q1E� s 2r� c
C s t j | j � } x� t | j � D]� } x� t | j � D]� } d } x� t | j � D]� } t j t | | d | �d � d } d } xF t | j � D]5 } | t | | | | � t
| | | | | � 7} q� W| d | | 7} qT W| | t | | | � <q8 Wq" W| S)Ng r| r) r re ) r� r� r r+ r� r� rZ r r� r� r� r� )
r� rH rj r� r� Z unit_gradr| Zvar1Zvar2r� r r r �Q1GradE� s &3 r� c C sl | j | � } d | d | d d | } t j | | j d f � j } t j | j | d d �} | S)Nr) r r; r )r2 r� �tiler r� r r )r� rH �ar Zgmatr� r r r �Q0GradV� s
r� c
C s� | j | � } d } x� t | j � D]� \ } } | j | � } t j | | | j d f � j } t j | j | d d � f | d d �} t j | | d � d } | | | 7} q% Wd | } | S)Ng r r; r r) re )
r2 rD rd r� r� r� r r� r r )
r� rH r� rj Zr_indr, Zcurr_binding_indrg ri rh r r r �Q1GradV� s ",
r� )%rV �numpyr� r3 r� rp �scipyr �pandasr5 r � collectionsr �matplotlib.pyplot�pyplotr� �ver�objectr rM r} r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r �<module> sJ ��� � 5� � � � �#/ 3E