-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFixing_dend_models_presentation.py
More file actions
4561 lines (3358 loc) · 198 KB
/
Fixing_dend_models_presentation.py
File metadata and controls
4561 lines (3358 loc) · 198 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
import sys
from scipy.stats import sem
sys.path.append('..')
from utils_TCA_clustering_scratchpad import *
from GLM_regression_plotting import *
from modelling_to_date_utils import *
import os, sys, time, resource
import time
import random
import matplotlib as mpl
from matplotlib.font_manager import FontProperties
from scipy.signal import fftconvolve
def fit_equal_contrib_L2(EC, NDNF, SST, eps=1e-12):
EC = np.asarray(EC, dtype=float).ravel()
NDNF = np.asarray(NDNF, dtype=float).ravel()
SST = np.asarray(SST, dtype=float).ravel()
ndnf_norm = np.linalg.norm(NDNF)
sst_norm = np.linalg.norm(SST)
if sst_norm < eps:
raise ValueError("SST vector near zero; cannot enforce L2 equality.")
r = ndnf_norm / (sst_norm + eps)
Z = NDNF + r * SST
denom = np.dot(Z, Z)
if denom < eps:
raise ValueError("Design vector Z is near zero; cannot solve.")
ndnf_sf = np.dot(Z, EC) / denom
sst_sf = r * ndnf_sf
# diagnostics
contrib_ndnf = ndnf_norm * ndnf_sf
contrib_sst = sst_norm * sst_sf
fit = ndnf_sf * Z
residual = EC - fit
mse = np.mean(residual**2)
return {
"ndnf_sf": ndnf_sf,
"sst_sf": sst_sf,
"ratio_r": r,
"mse": mse,
"contrib_L2_ndnf": contrib_ndnf,
"contrib_L2_sst": contrib_sst,
}
def fit_sst_scale_to_cancel_ec(EC, SST, mask=None, nonneg=True, eps=1e-12):
"""
Least-squares scalar s minimizing ||EC - s*SST||_2 over mask.
Returns (s, info) where info has diagnostics.
"""
EC = np.asarray(EC, dtype=float)
SST = np.asarray(SST, dtype=float)
assert EC.shape == SST.shape, f"Shape mismatch: EC{EC.shape} vs SST{SST.shape}"
if mask is None:
mask = np.isfinite(EC) & np.isfinite(SST)
else:
mask = np.asarray(mask, dtype=bool) & np.isfinite(EC) & np.isfinite(SST)
if not np.any(mask):
return 0.0, {"reason": "empty mask (no finite entries)"}
ec = EC[mask].ravel()
sst = SST[mask].ravel()
den = float(np.dot(sst, sst))
if den < eps:
return 0.0, {"reason": "near-zero SST energy", "den": den, "n": sst.size}
num = float(np.dot(ec, sst))
s = num / den
if nonneg:
s = max(0.0, s)
return s, {"num": num, "den": den, "n": sst.size}
def to_bool(x):
if isinstance(x, bool):
return x
if isinstance(x, str):
s = x.strip().lower()
if s in {"true", "t", "1", "yes", "y"}:
return True
if s in {"false", "f", "0", "no", "n"}:
return False
raise ValueError(f"Cannot parse boolean from: {x!r}")
def get_dend_VM_cell_type_new(residual_activity_dict_EC, factors_dict_EC, GLM_params_EC, include_beta=True, const_vel=True, flat_input=False, animal_by_animal=False, animal_used=None):
animal_by_animal = to_bool(animal_by_animal)
flat_input = to_bool(flat_input)
include_beta = to_bool(include_beta)
data_list_normalized = []
for animal in residual_activity_dict_EC:
for cell in residual_activity_dict_EC[animal]:
data_normalized = residual_activity_dict_EC[animal][cell][:,:58]
data_normalized = ((data_normalized - np.min(data_normalized)) / (np.max(data_normalized) - np.min(data_normalized))) *50
data_list_normalized.append(data_normalized)
data_array_normalized = np.array(data_list_normalized)
mu= np.mean(data_list_normalized)
sigma = np.std(data_list_normalized)
dendrite = np.zeros((50, 58))
dendrite_list = []
animal_velocity_list = []
if animal_by_animal:
animal = animal_used
for cell in residual_activity_dict_EC[animal]:
data = residual_activity_dict_EC[animal][cell]
data = data[:,:58]
if flat_input:
data = np.zeros((data.shape))
weights = GLM_params_EC[animal][cell]['weights']["Velocity"]
if const_vel:
animal_velocity = np.full((50, 58), 0.43)
animal_velocity_list.append(animal_velocity)
if include_beta:
data = data + mu + (weights * animal_velocity * sigma) #+ intercept
else:
data = data + mu
else:
animal_velocity = factors_dict_EC[animal]["Velocity"][:,:58]
animal_velocity_list.append(animal_velocity)
if include_beta:
data = data + mu + (weights * animal_velocity * sigma) #+ intercept
else:
data = data + mu
dendrite += data
dendrite_list.append(data)
else:
for animal in residual_activity_dict_EC:
for cell in residual_activity_dict_EC[animal]:
data = residual_activity_dict_EC[animal][cell]
data = data[:,:58]
if flat_input:
data = np.zeros((data.shape))
weights = GLM_params_EC[animal][cell]['weights']["Velocity"]
if const_vel:
animal_velocity = np.full((50, 58), 0.43)
animal_velocity_list.append(animal_velocity)
if include_beta:
data = data + mu + (weights * animal_velocity * sigma) #+ intercept
else:
data = data + mu
else:
animal_velocity = factors_dict_EC[animal]["Velocity"][:,:58]
animal_velocity_list.append(animal_velocity)
if include_beta:
data = data + mu + (weights * animal_velocity * sigma) #+ intercept
else:
data = data + mu
dendrite#_ta_list.append(np.mean(data, axis=1))
dendrite += data
dendrite_list.append(data)
an_velocity = np.array(animal_velocity_list)
an_velocity = np.nanmean(an_velocity, axis=0)
return an_velocity, dendrite_list #, dendrite_ta_list
# def get_dend_VM_cell_type(residual_activity_dict, factors_dict_EC, mean_new_average_vel_array, GLM_params, dend_sf, amplitude=-5, vel=23, norm=False, add_vel_contribution=False, const_vel=True, use_averaged_velocity=None, add_inh=None, normalize_hz=False, make_it_spike=False, animal_by_animal=False, animal=None):
# dendrite = np.zeros((50, 58))
# dendrite_list = []
# dendrite_ta_list = []
# if use_averaged_velocity=="cell_type_av":
# animal_velocity = np.tile(mean_new_average_vel_array[:, np.newaxis], (1, 58))
# animal_velocity_list = []
# for animal in residual_activity_dict:
# for cell in residual_activity_dict[animal]:
# data = residual_activity_dict[animal][cell]
# data = data[:,:58]
# weights = GLM_params[animal][cell]['weights']["Velocity"]
# intercept = GLM_params[animal][cell]['intercept']
# if const_vel:
# animal_velocity = np.full((50, 58), vel)
# data = data + (weights * animal_velocity) + intercept
# dendrite_ta_list.append(np.mean(data, axis=1))
# # if make_it_spike:
# # data = (data - np.max(data)) / (np.min(data)-np.max(data)) * 50
# elif add_vel_contribution:
# if use_averaged_velocity=="cell_type_av":
# animal_velocity = np.tile(mean_new_average_vel_array[:, np.newaxis], (1, 58))
# elif use_averaged_velocity=="actual_velocity":
# animal_velocity = factors_dict_EC[animal]["Velocity"][:,:58]
# animal_velocity_list.append(animal_velocity)
# data = data + (weights * animal_velocity) + intercept
# # if make_it_spike:
# # data = (data - np.max(data)) / (np.min(data)-np.max(data)) * 50
# # if norm == "min_max":
# # data = normalize(data, norm='min_max', per_cell=False) * 10
# # if make_it_spike:
# # data = (data - np.max(data)) / (np.min(data)-np.max(data)) * 50
# dendrite += data
# dendrite_list.append(data)
# dendrite = dendrite * dend_sf
# if add_vel_contribution:
# if use_averaged_velocity=="actual_velocity":
# # if add_inh == 'both' or add_inh == 'sst':
# animal_velocity_array = np.array(animal_velocity_list)
# animal_velocity = np.mean(animal_velocity_array, axis=0)
# # else:
# # animal_velocity_array = np.array(animal_velocity_list)
# # animal_velocity = np.mean(animal_velocity_array, axis=2)
# for i in range(len(dendrite_ta_list)):
# plt.plot(dendrite_ta_list[i])
# plt.show()
# return animal_velocity, dendrite_list
# def get_dend_VM_cell_type(residual_activity_dict, factors_dict_EC, mean_new_average_vel_array, GLM_params, dend_sf, amplitude=-5, vel=23, norm=False, add_vel_contribution=False, const_vel=True, use_averaged_velocity=None, add_inh=None, normalize_hz=False, make_it_spike=False, animal_by_animal=False, animal=None):
# # dendrite = np.zeros((50, 58))
# if use_averaged_velocity=="cell_type_av":
# animal_velocity = np.tile(mean_new_average_vel_array[:, np.newaxis], (1, 58))
# animal_velocity_list = []
# dendrite_list = []
# data_list_normalized = []
# means_list = []
# for animal in residual_activity_dict:
# for cell in residual_activity_dict[animal]:
# data_normalized = residual_activity_dict[animal][cell][:,:58]
# data_normalized = (data_normalized - np.min(data_normalized)) / (np.max(data_normalized) - np.min(data_normalized)) *50
# data_list_normalized.append(data_normalized)
# print(f"np.mean(means_list) {np.mean(means_list)}")
# # data_array_normalized = np.array(data_list_normalized)
# overall_mu= np.mean(data_list_normalized)
# overall_std = np.std(data_list_normalized)
# print(f"overall_mu {overall_mu} overall_std {overall_std}")
# ta_data_list = []
# if animal_by_animal:
# print(f"residual_activity_dict.keys() {residual_activity_dict.keys()}")
# for cell in residual_activity_dict[animal]:
# data = residual_activity_dict[animal][cell]
# data = data[:,:58]
# weights = GLM_params[animal][cell]['weights']["Velocity"]
# intercept = GLM_params[animal][cell]['intercept']
# if const_vel:
# animal_velocity = np.full((50, 58), vel)
# data_offset_by_mu = data + overall_mu
# data = data_offset_by_mu + (weights * animal_velocity * overall_std)
# print(f"data.shape {data.shape}")
# ta_data_list.append(np.mean(data, axis=1))
# # data = data + (weights * animal_velocity) + intercept
# # data = (data - np.max(data)) / (np.min(data)-np.max(data)) * 50
# elif add_vel_contribution:
# if use_averaged_velocity=="cell_type_av":
# animal_velocity = np.tile(mean_new_average_vel_array[:, np.newaxis], (1, 58))
# elif use_averaged_velocity=="actual_velocity":
# animal_velocity = factors_dict_EC[animal]["Velocity"][:,:58]
# animal_velocity_list.append(animal_velocity)
# data_offset_by_mu = data + overall_mu
# data = data_offset_by_mu + (weights * animal_velocity * overall_std)
# print(f"data.shape {data.shape}")
# ta_data_list.append(np.mean(data, axis=1))
# # data = data + (weights * animal_velocity) + intercept
# # # if make_it_spike:
# # data = (data - np.max(data)) / (np.min(data)-np.max(data)) * 50
# # if norm == "min_max":
# # data = normalize(data, norm='min_max', per_cell=False) * 10
# # if make_it_spike:
# # print("WE MADE IT ALL THE WAY HEREEEEEEEEEEEE")
# # data = (data - np.max(data)) / (np.min(data)-np.max(data)) * 50
# # dendrite += data
# dendrite_list.append(data)
# else:
# for animal in residual_activity_dict:
# for cell in residual_activity_dict[animal]:
# data = residual_activity_dict[animal][cell]
# data = data[:,:58]
# weights = GLM_params[animal][cell]['weights']["Velocity"]
# # intercept = GLM_params[animal][cell]['intercept']
# if const_vel:
# animal_velocity = np.full((50, 58), vel)
# # data = data + (weights * animal_velocity) + intercept
# # if make_it_spike:
# # print("WE MADE IT SPIKE")
# # data = (data - np.max(data)) / (np.min(data)-np.max(data)) * 50
# data_offset_by_mu = data + overall_mu
# data = data_offset_by_mu + (weights * animal_velocity * overall_std)
# elif add_vel_contribution:
# if use_averaged_velocity=="cell_type_av":
# animal_velocity = np.tile(mean_new_average_vel_array[:, np.newaxis], (1, 58))
# elif use_averaged_velocity=="actual_velocity":
# animal_velocity = factors_dict_EC[animal]["Velocity"][:,:58]
# animal_velocity_list.append(animal_velocity)
# data_offset_by_mu = data_array + overall_mu
# data = data_offset_by_mu + (weights * animal_velocity * overall_std)
# # data = data + (weights * animal_velocity) + intercept
# # if make_it_spike:
# # data = (data - np.max(data)) / (np.min(data)-np.max(data)) * 50
# # if norm == "min_max":
# # data = normalize(data, norm='min_max', per_cell=False) * 10
# # if make_it_spike:
# # data = (data - np.max(data)) / (np.min(data)-np.max(data)) * 50
# # dendrite += data
# dendrite_list.append(data)
# # for i in range(len(ta_data_list)):
# # plt.plot(ta_data_list[i])
# # plt.show()
# # dendrite = dendrite * dend_sf
# if add_vel_contribution:
# if use_averaged_velocity=="actual_velocity":
# # if add_inh == 'both' or add_inh == 'sst':
# animal_velocity_array = np.array(animal_velocity_list)
# animal_velocity = np.mean(animal_velocity_array, axis=0)
# # else:
# # animal_velocity_array = np.array(animal_velocity_list)
# # animal_velocity = np.mean(animal_velocity_array, axis=2)
# return animal_velocity, dendrite_list
def get_real_velocity_array(filtered_factors_dict_EC, filtered_factors_dict_SST, filtered_factors_dict):
new_average_vel = []
for animal in filtered_factors_dict_EC:
for cell in filtered_factors_dict_EC[animal]:
new_average_vel.append(np.mean(filtered_factors_dict_EC[animal][cell], axis=1))
for animal in filtered_factors_dict_SST:
for cell in filtered_factors_dict_SST[animal]:
new_average_vel.append(np.mean(filtered_factors_dict_SST[animal][cell], axis=1))
for idx, animal in enumerate(filtered_factors_dict):
if idx > 8:
for cell in filtered_factors_dict[animal]:
new_average_vel.append(np.mean(filtered_factors_dict[animal][cell], axis=1))
new_average_vel_array = np.array(new_average_vel)
mean_new_average_vel_array = np.mean(new_average_vel_array, axis=0)
return mean_new_average_vel_array
def fit_equal_contrib_L2(EC, NDNF, SST, eps=1e-12, SST_bias_factor=1.0):
"""
Enforce L2 contribution: ||SST||*sst_sf = (SST_bias_factor) * ||NDNF||*ndnf_sf
and fit EC ≈ ndnf_sf*NDNF + sst_sf*SST in least squares.
Returns dict with ndnf_sf, sst_sf, ratio_r_b, mse, contribs.
"""
EC = np.asarray(EC, dtype=float).ravel()
NDNF = np.asarray(NDNF, dtype=float).ravel()
SST = np.asarray(SST, dtype=float).ravel()
ndnf_norm = np.linalg.norm(NDNF)
sst_norm = np.linalg.norm(SST)
if sst_norm < eps:
raise ValueError("SST vector near zero; cannot enforce L2 equality.")
if ndnf_norm < eps:
raise ValueError("NDNF vector near zero; cannot enforce L2 equality.")
# enforce biased equality of contributions
r_b = SST_bias_factor * (ndnf_norm / (sst_norm + eps)) # sst_sf = r_b * ndnf_sf
Z = NDNF + r_b * SST
denom = np.dot(Z, Z)
if denom < eps:
raise ValueError("Design vector Z is near zero; cannot solve.")
ndnf_sf = np.dot(Z, EC) / denom
sst_sf = r_b * ndnf_sf
fit = ndnf_sf * Z
residual = EC - fit
mse = np.mean(residual**2)
contrib_ndnf = ndnf_norm * ndnf_sf
contrib_sst = sst_norm * sst_sf
return {
"ndnf_sf": ndnf_sf,
"sst_sf": sst_sf,
"ratio_r_b": r_b,
"mse": mse,
"contrib_L2_ndnf": contrib_ndnf,
"contrib_L2_sst": contrib_sst,
}
def random_timeseries(initial_value: float, volatility: float, count: int) -> list:
# time_series = []
# for _ in range(count+1):
# initial_value += random.gauss(0, 1) * volatility
# time_series.append(initial_value)
# return time_series
time_series = []
for _ in range(count+1):
time_series.append(initial_value + random.gauss(0, 1) * volatility)
return time_series
def _sanitize_velocity_cm_s(v_in_m_per_s, min_vel_cm_s=1e-3 * 100):
"""
Convert m/s -> cm/s and make strictly positive.
Accepts 1D (n_pos,) or 2D (n_pos, n_trials). Returns same shape.
Fills NaNs/<=0 by interpolation along the position axis, per trial.
"""
v = np.asarray(v_in_m_per_s, dtype=np.float32) * np.float32(100.0) # m/s -> cm/s
def _sanitize_1d(x):
# operate on the passed slice, not on the outer 'v'
bad = ~np.isfinite(x) | (x <= 0)
if bad.any():
good_idx = np.flatnonzero(~bad)
bad_idx = np.flatnonzero(bad)
if good_idx.size >= 2:
x[bad] = np.interp(bad_idx, good_idx, x[good_idx])
elif good_idx.size == 1:
x[bad] = x[good_idx[0]]
else:
x[:] = np.float32(10.0) # fallback if everything is bad
return np.maximum(x, np.float32(min_vel_cm_s))
if v.ndim == 1:
return _sanitize_1d(v)
if v.ndim == 2:
out = v.copy()
for t in range(out.shape[1]):
out[:, t] = _sanitize_1d(out[:, t])
return out
raise ValueError(f"sanitize_velocity_cm_s: expected 1D or 2D, got shape {v.shape}")
def exp_kernel(tau_ms, dt_ms, n_taus=5, norm="peak", target=1.0):
# simple single-exponential fallback
L = int(np.ceil(10.0 * tau_ms / max(dt_ms, 1e-6)))
t = np.arange(max(L, 1), dtype=np.float32) * np.float32(dt_ms)
k = np.exp(-t / np.float32(tau_ms)).astype(np.float32, copy=False)
if norm == "peak":
m = float(k.max()) if k.size else 1.0
k = (np.float32(target) * k) / np.float32(max(m, 1e-12))
elif norm == "area":
area = float(k.sum()) * (dt_ms / 1000.0)
k = (np.float32(target) * k) / np.float32(max(area, 1e-12))
return k
def get_inhom_poisson_spike_times_by_thinning(rate, t, dt=0.02, refractory=3., generator=None, rng=None):
"""
Given a time series of instantaneous spike rates in Hz, produce a spike train consistent with an inhomogeneous
Poisson process with a refractory period after each spike.
:param rate: instantaneous rates in time (Hz)
:param t: corresponding time values (ms)
:param dt: temporal resolution for spike times (ms)
:param refractory: absolute deadtime following a spike (ms)
:param generator: :class:'random.Random()'
:return: list of m spike times (ms)
"""
if generator is None:
generator = rng
interp_t = np.arange(t[0], t[-1] + dt, dt)
interp_rate = np.interp(interp_t, t, rate)
interp_rate /= 1000.
non_zero = np.where(interp_rate > 0.)[0]
interp_rate[non_zero] = 1. / (1. / interp_rate[non_zero] - refractory)
spike_times = []
max_rate = np.max(interp_rate)
i = 0
ISI_memory = 0.
while i < len(interp_t):
x = generator.random()
if x > 0.:
ISI = -np.log(x) / max_rate
i += int(ISI / dt)
ISI_memory += ISI
if (i < len(interp_t)) and (generator.random() <= interp_rate[i] / max_rate) and ISI_memory >= 0.:
spike_times.append(interp_t[i])
ISI_memory = -refractory
return np.array(spike_times)
# def get_inhom_poisson_spike_times_by_thinning(rate, t, dt=0.02, refractory=3., generator=None, rng=None):
# """
# Given a time series of instantaneous spike rates in Hz, produce a spike train consistent with an inhomogeneous
# Poisson process with a refractory period after each spike.
# :param rate: instantaneous rates in time (Hz)
# :param t: corresponding time values (ms)
# :param dt: temporal resolution for spike times (ms)
# :param refractory: absolute deadtime following a spike (ms)
# :param generator: random.Random()-like or NumPy Generator (falls back to rng if None)
# :return: 1D np.array of spike times (ms)
# """
# # --- tiny micro-optimizations, same math/IO ---
# rate = np.asarray(rate, dtype=np.float64)
# t = np.asarray(t, dtype=np.float64)
# # prefer 'generator', fall back to 'rng'
# if generator is None:
# generator = rng
# # get a scalar uniform sampler without conditionals in the loop
# # supports both random.Random and np.random.Generator
# rand = generator.random if hasattr(generator, "random") else generator
# # build interpolation grid (identical spacing)
# t0 = float(t[0]); t1 = float(t[-1])
# n_steps = int(np.floor((t1 - t0) / dt)) + 1
# interp_t = t0 + np.arange(n_steps, dtype=np.float64) * dt # == np.arange(t0, t1+dt, dt)
# # interpolate rate and convert Hz -> per ms
# interp_rate = np.interp(interp_t, t, rate).astype(np.float64, copy=False) / 1000.0
# # refractory adjustment only where rate > 0
# pos = interp_rate > 0.0
# # r' = 1 / (1/r - refractory) (units: ms^-1, refractory in ms)
# interp_rate[pos] = 1.0 / (1.0 / interp_rate[pos] - refractory)
# # if all rates are <= 0, return empty (same semantics, faster early-exit)
# max_rate = float(np.max(interp_rate))
# if not np.isfinite(max_rate) or max_rate <= 0.0:
# return np.empty(0, dtype=np.float64)
# inv_max_rate = 1.0 / max_rate # hoist division out of loop
# inv_dt = 1.0 / dt
# spike_times = []
# append = spike_times.append # local binding for speed
# i = 0
# ISI_memory = 0.0
# # loop structure identical; keep exact accept/reject logic
# while i < n_steps:
# # guard against rare 0.0 exactly to avoid log(0)
# x = rand()
# if x == 0.0:
# x = np.finfo(np.float64).tiny
# ISI = -np.log(x) * inv_max_rate # == -log(x)/max_rate
# i += int(ISI * inv_dt) # == int(ISI/dt)
# ISI_memory += ISI
# if i < n_steps:
# # second uniform for thinning
# y = rand()
# if (y <= interp_rate[i] * inv_max_rate) and (ISI_memory >= 0.0):
# append(interp_t[i])
# ISI_memory = -refractory
# return np.asarray(spike_times, dtype=np.float64)
# import numpy as np
# import math
# def get_inhom_poisson_spike_times_by_thinning_new(rate, t, dt=0.02, refractory=3., generator=None, rng=None):
# """
# Given a time series of instantaneous spike rates in Hz, produce a spike train
# consistent with an inhomogeneous Poisson process with an absolute refractory period.
# - rate: Hz at times t (ms)
# - t: ms (monotonic)
# - dt: ms grid for interpolation & returned spike times
# - refractory: ms absolute deadtime
# """
# # Choose RNG (backward compatible with your original signature)
# if generator is None and rng is None:
# rng = np.random.default_rng()
# if rng is None:
# # wrap a Python random.Random as a minimal interface
# class _PyRandWrapper:
# def random(self, size=None):
# if size is None:
# return generator.random()
# # vectorized draw
# return np.array([generator.random() for _ in range(size)], dtype=float)
# def exponential(self, scale, size=None):
# # inverse-transform using .random()
# u = self.random(size=size)
# return -np.log(u) * scale
# rng = _PyRandWrapper()
# # Interpolate onto uniform grid (ms). Same as your original.
# t0 = float(t[0])
# t_end = float(t[-1])
# interp_t = np.arange(t0, t_end + dt, dt, dtype=float)
# interp_rate = np.interp(interp_t, t, rate).astype(float, copy=False)
# # Convert Hz -> kHz (per ms), then apply refractory correction (identical math)
# interp_rate /= 1000.0
# mask = interp_rate > 0.0
# interp_rate[mask] = 1.0 / (1.0 / interp_rate[mask] - refractory)
# max_rate = float(np.max(interp_rate))
# if not np.isfinite(max_rate) or max_rate <= 0.0:
# return np.empty(0, dtype=float)
# # Ogata thinning: jump in time with Exp(max_rate), accept with r(t)/max_rate,
# # and enforce absolute refractory in ms.
# # We work in continuous time then snap to the dt-grid indices.
# spikes = []
# t_curr = t0
# last_spike_t = -math.inf # enforce refractory in ms
# # Draw in batches to minimize Python overhead
# batch = 1024
# while t_curr < t_end:
# # Draw a batch of proposed ISIs (ms)
# isis = rng.exponential(scale=1.0/max_rate, size=batch)
# # Cumulative jump times for the whole batch
# cum = np.cumsum(isis)
# # Turn into absolute proposal times (ms)
# props = t_curr + cum
# # Stop at first proposal beyond t_end; process those within
# valid_n = int(np.searchsorted(props, t_end, side='right'))
# if valid_n == 0:
# # advance time and continue
# t_curr = props[-1]
# continue
# # Convert proposal times to nearest grid index (floor)
# idx = np.floor((props[:valid_n] - t0) / dt).astype(int)
# idx = np.clip(idx, 0, interp_t.size - 1)
# accept_prob = interp_rate[idx] / max_rate
# # Draw uniforms for accept/reject
# u = rng.random(size=valid_n)
# accepted = u <= accept_prob
# # Apply refractory: keep only those with (props - last_spike_t) >= refractory
# if accepted.any():
# for k in np.nonzero(accepted)[0]:
# tp = props[k]
# if tp - last_spike_t >= refractory:
# spikes.append(tp)
# last_spike_t = tp
# # Advance base time by the last ISI in the batch
# t_curr = props[valid_n-1] if valid_n > 0 else props[-1]
# return np.asarray(spikes, dtype=float)
def get_inhom_poisson_spike_times_by_thinning_ms(
rate_hz, # instantaneous rate in Hz
t_ms, # time axis in ms (same length as rate_hz)
dt_ms=1.0, # step (ms)
refractory_ms=3.0, # absolute refractory (ms)
generator=None, # optional: python random.Random()
rng=None # optional: numpy Generator
):
"""
ms-native thinning sampler (very close to your original).
Returns spike times in ms as float64.
"""
import numpy as np
# Choose RNG
if generator is None:
if rng is None:
import random
generator = random.Random()
else:
# wrap numpy Generator to a .random() float API
class _Wrap:
def __init__(self, g): self.g = g
def random(self): return float(self.g.random())
generator = _Wrap(rng)
# Build a uniform ms grid and interpolate rate onto it
t_ms = np.asarray(t_ms, dtype=np.float64)
interp_t_ms = np.arange(t_ms[0], t_ms[-1] + dt_ms, dt_ms, dtype=np.float64)
interp_rate_hz = np.interp(interp_t_ms, t_ms, np.asarray(rate_hz, dtype=np.float64))
# sanitize: NaNs/inf -> 0; negative -> 0
if not np.all(np.isfinite(interp_rate_hz)):
np.nan_to_num(interp_rate_hz, copy=False)
np.maximum(interp_rate_hz, 0.0, out=interp_rate_hz)
# Convert to spikes/ms
rate_per_ms = interp_rate_hz / 1000.0
# Effective rate with absolute refractory (in ms)
# same algebra as your original but in ms-units:
non_zero = rate_per_ms > 0.0
if np.any(non_zero):
rate_per_ms[non_zero] = 1.0 / (1.0 / rate_per_ms[non_zero] - refractory_ms)
# clip negatives that can arise if refractory is too large for the rate
np.maximum(rate_per_ms, 0.0, out=rate_per_ms)
max_rate_per_ms = float(np.max(rate_per_ms)) if rate_per_ms.size else 0.0
if not np.isfinite(max_rate_per_ms) or max_rate_per_ms <= 0.0:
return np.empty(0, dtype=np.float64)
# Thinning loop
spike_times = []
i = 0
ISI_memory_ms = 0.0
n = len(interp_t_ms)
while i < n:
x = generator.random()
if x <= 0.0:
# extremely rare; skip to avoid log(0)
i += 1
continue
# draw ISI from exp with max rate (units: ms)
ISI_ms = -np.log(x) / max_rate_per_ms
i += int(ISI_ms / dt_ms)
ISI_memory_ms += ISI_ms
if i < n:
# accept with probability rate/max_rate
if generator.random() <= (rate_per_ms[i] / max_rate_per_ms) and ISI_memory_ms >= 0.0:
spike_times.append(interp_t_ms[i])
ISI_memory_ms = -refractory_ms
return np.array(spike_times, dtype=np.float64)
def epsps_event_add(spike_idx, T, kernel):
"""
Exact causal conv with `kernel` using event-driven accumulation.
spike_idx: 1D int array of spike times (samples)
T: length of output trace
kernel: 1D float array (causal; length K)
returns: 1D float array of length T
"""
out = np.zeros(T, dtype=np.float32)
K = kernel.shape[0]
for s in spike_idx:
if 0 <= s < T:
end = min(T, s + K)
out[s:end] += kernel[:(end - s)]
return out
def activity_to_dend_vm_2d(
A_trials_time,
Vrest=-70.0,
vm_scale=0.1,
center_across="time", # "time" | "time_trials" | "none"
dtype=np.float32):
"""
A_trials_time: (n_trials, T) activity (may contain NaNs)
Returns:
Vm: (n_trials, T) in mV
A_centered: centered activity (same shape)
mu: the mean(s) removed (scalar or array)
"""
A = np.asarray(A_trials_time, dtype=dtype, order="C")
if A.ndim != 2:
raise ValueError(f"A must be 2D (trials, time); got {A.shape}")
if center_across == "time":
# per-trial time mean -> each trial mean becomes Vrest after scaling/offset
mu = np.nanmean(A, axis=1, keepdims=True).astype(dtype, copy=False)
elif center_across == "time_trials":
# single global mean over all trials and time
mu = np.nanmean(A, keepdims=True).astype(dtype, copy=False)
elif center_across == "none":
mu = dtype(0.0)
else:
raise ValueError("center_across must be 'time', 'time_trials', or 'none'")
A_centered = (A - mu).astype(dtype, copy=False)
Vm = dtype(Vrest) + dtype(vm_scale) * A_centered
return Vm, A_centered, (mu if np.isscalar(mu) else mu.astype(dtype, copy=False))
def _fmt_bytes(n):
if n is None: return "n/a"
for u in ("B","KB","MB","GB","TB"):
if n < 1024 or u == "TB":
return f"{n:,.1f} {u}"
n /= 1024.0
def _get_peak_rss_bytes():
"""
Peak RSS for the process since start.
macOS: ru_maxrss is bytes; Linux: kilobytes → convert to bytes.
"""
ru = resource.getrusage(resource.RUSAGE_SELF).ru_maxrss
return ru if sys.platform == "darwin" else ru * 1024
def _get_current_rss_bytes():
"""
Current RSS snapshot (needs psutil; returns None if unavailable).
"""
try:
import psutil
return psutil.Process(os.getpid()).memory_info().rss
except Exception:
return None
def get_contr_wrapper(residual_activity_dict_EC, fixed_residual_activity_dict_NDNF_newest, residual_activity_dict_SST, factors_dict_EC, factors_dict_SST, factors_dict_NDNF_newest, GLM_params_EC, GLM_params_NDNF_newest, GLM_params_SST, mean_new_average_vel_array, vel_applied='real', add_inh=None, SST_bias_factor=None, use_averaged_velocity=None):
if vel_applied=="real":
constant_vel=False
real_vel=True
dend_contribution_EC, dend_contribution_NDNF, dend_contribution_SST, an_velocity, NDNF_sf_opt, SST_sf_opt, NDNF_contribution_sum, SST_contribution_sum = get_dend_contribution(residual_activity_dict_EC, fixed_residual_activity_dict_NDNF_newest, residual_activity_dict_SST, factors_dict_EC, factors_dict_SST, factors_dict_NDNF_newest, GLM_params_EC, GLM_params_NDNF_newest, GLM_params_SST, mean_new_average_vel_array, real_vel=real_vel, constant_vel=constant_vel, use_residuals=True, add_inh=add_inh, SST_bias_factor=SST_bias_factor, use_averaged_velocity=use_averaged_velocity)
elif vel_applied=="constant":
constant_vel=True
real_vel=False
dend_contribution_EC, dend_contribution_NDNF, dend_contribution_SST, an_velocity, NDNF_sf_opt, SST_sf_opt, NDNF_contribution_sum, SST_contribution_sum = get_dend_contribution(residual_activity_dict_EC, fixed_residual_activity_dict_NDNF_newest, residual_activity_dict_SST, factors_dict_EC, factors_dict_SST, factors_dict_NDNF_newest, GLM_params_EC, GLM_params_NDNF_newest, GLM_params_SST, mean_new_average_vel_array, real_vel=real_vel, constant_vel=constant_vel, use_residuals=True, add_inh=add_inh, SST_bias_factor=SST_bias_factor, use_averaged_velocity=use_averaged_velocity)
elif vel_applied=="model":
constant_vel=True
real_vel=False
dend_contribution_EC, dend_contribution_NDNF, dend_contribution_SST, an_velocity, NDNF_sf_opt, SST_sf_opt, NDNF_contribution_sum, SST_contribution_sum = get_dend_contribution(residual_activity_dict_EC, fixed_residual_activity_dict_NDNF_newest, residual_activity_dict_SST, factors_dict_EC, factors_dict_SST, factors_dict_NDNF_newest, GLM_params_EC, GLM_params_NDNF_newest, GLM_params_SST, mean_new_average_vel_array, real_vel=real_vel, constant_vel=constant_vel, use_residuals=True, add_inh=add_inh, use_model_EC=True, SST_bias_factor=SST_bias_factor, use_averaged_velocity=use_averaged_velocity)
else:
constant_vel=False
real_vel=False
dend_contribution_EC, dend_contribution_NDNF, dend_contribution_SST, an_velocity, NDNF_sf_opt, SST_sf_opt, NDNF_contribution_sum, SST_contribution_sum = get_dend_contribution(residual_activity_dict_EC, fixed_residual_activity_dict_NDNF_newest, residual_activity_dict_SST, factors_dict_EC, factors_dict_SST, factors_dict_NDNF_newest, GLM_params_EC, GLM_params_NDNF_newest, GLM_params_SST, mean_new_average_vel_array, real_vel=real_vel, constant_vel=constant_vel, use_residuals=False, add_inh=add_inh, SST_bias_factor=SST_bias_factor, use_averaged_velocity=use_averaged_velocity)
return dend_contribution_EC, dend_contribution_NDNF, dend_contribution_SST, an_velocity, NDNF_sf_opt, SST_sf_opt, NDNF_contribution_sum, SST_contribution_sum
def count_plateaus_by_position_from_abs(plateau_abs_times, # 1D array, seconds
bin_starts_by_trial, # shape (n_trials, 51), seconds, relative per trial
trial_starts_abs=None): # shape (n_trials,), seconds
plateau_abs_times = np.asarray(plateau_abs_times, float)
n_trials, n_edges = bin_starts_by_trial.shape
n_pos_bins = n_edges - 1
# derive trial starts if not provided (assumes no gaps)
if trial_starts_abs is None:
trial_durations = bin_starts_by_trial[:, -1]
trial_starts_abs = np.concatenate([[0.0], np.cumsum(trial_durations[:-1])])
counts = np.zeros(n_pos_bins, dtype=int)
for t in range(n_trials):
start = trial_starts_abs[t]
end = start + bin_starts_by_trial[t, -1]
mask = (plateau_abs_times >= start) & (plateau_abs_times < end)
if not np.any(mask):
continue
rel = plateau_abs_times[mask] - start # seconds within this trial
edges = bin_starts_by_trial[t] # len 51
pos_idx = np.searchsorted(edges, rel, side='right') - 1
pos_idx = np.clip(pos_idx, 0, n_pos_bins-1)
np.add.at(counts, pos_idx, 1)
return counts
def get_internals_summed_dendrite(an_velocity, summed_dendrite, dt=0.001, dend_threshold=None, vel_applied=None):
animal_velocity_constant = np.full((summed_dendrite.shape), 23)
total_time_sec = 4.71657036
dt=total_time_sec/50
dx=180/50
proper_velocity=an_velocity*100
animal_velocity_constant= np.full((summed_dendrite.shape), dx/dt)
if vel_applied=="constant":
dt = dx / animal_velocity_constant
else:
dt = dx / proper_velocity
time_bins = np.cumsum(dt, axis=0)
time_bins_ms = time_bins * 1
num_trials = summed_dendrite.shape[1]
trial_warped_activity = []
max_len = 0
for t in range(num_trials):
if np.any(np.isnan(time_bins[:, t])):
continue
total_time = time_bins[-1, t]
time_axis_constant = np.arange(0, total_time, dt)
firing = summed_dendrite[:, t]
warped_firing = np.interp(time_axis_constant, time_bins_ms[:,t], firing)