structure
stringlengths 50
3.96k
| text
stringlengths 49
3.87k
| image
imagewidth (px) 288
1.28k
| download_url
stringlengths 33
34
| instance_name
stringlengths 18
19
| date
stringclasses 53
values | additional_info
stringlengths 785
2.42k
| date_scrapped
stringlengths 28
28
| file_filters
stringlengths 546
45.5k
| compilation_info
stringclasses 27
values | rendering_filters
stringlengths 168
184
| assets
sequencelengths 0
0
| category
stringclasses 1
value | uuid
stringlengths 38
38
| length
stringlengths 2
4
| difficulty
stringclasses 3
values |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
\begin{algorithmic}[1]
\State Input: Two multi-sets of $n$ points $R,B$ in $Q_d$.
\State Output: A matching from $R$ to $B$.
\State$\triangleright$ The set B is shared across all threads
\Procedure{WeightedMatch}{$R,B$}
\For {$r \in R$}\Comment{All for loop statements run in parallel}
\State $b\gets\mathrm{BreadthFirstSearch}(r,B)$
\State $M\gets M\cup \{r\to b\}$
\EndFor
\State \textbf{return} $M$\Comment{M is the matching}
\EndProcedure
\Procedure{BreadthFirstSearch}{$r,B$}
\For{$i=1,...,d$}
\For{$v\in Q_d$, $\|v-r\|_1=i$}
\If{$v\in B$}
\State $B\gets B\setminus{v}$
\State \textbf{return} $v$\Comment{r matches to v}
\EndIf
\EndFor
\EndFor
\EndProcedure
\end{algorithmic}
| \begin{algorithmic}
[1]
\State Input: Two multi-sets of $n$ points $R,B$ in $Q_d$.
\State Output: A matching from $R$ to $B$.
\State$\triangleright$ The set B is shared across all threads
\Procedure{WeightedMatch}{$R,B$}
\For {$r \in R$}\Comment{All for loop statements run in parallel}
\State $b\gets\mathrm{BreadthFirstSearch}(r,B)$
\State $M\gets M\cup \{r\to b\}$
\EndFor
\State \textbf{return} $M$\Comment{M is the matching}
\EndProcedure
\Procedure{BreadthFirstSearch}{$r,B$}
\For{$i=1,...,d$}
\For{$v\in Q_d$, $\|v-r\|_1=i$}
\If{$v\in B$}
\State $B\gets B\setminus{v}$
\State \textbf{return} $v$\Comment{r matches to v}
\EndIf
\EndFor
\EndFor
\EndProcedure
\end{algorithmic} | "https://arxiv.org/src/2401.11562" | "2401.11562.tar.gz" | "2024-01-21" | {
"title": "enhancing selectivity using wasserstein distance based reweighing",
"id": "2401.11562",
"abstract": "given two labeled data-sets $\\mathcal{s}$ and $\\mathcal{t}$, we design a simple and efficient greedy algorithm to reweigh the loss function such that the limiting distribution of the neural network weights that result from training on $\\mathcal{s}$ approaches the limiting distribution that would have resulted by training on $\\mathcal{t}$. on the theoretical side, we prove that when the metric entropy of the input data-sets is bounded, our greedy algorithm outputs a close to optimal reweighing, i.e., the two invariant distributions of network weights will be provably close in total variation distance. moreover, the algorithm is simple and scalable, and we prove bounds on the efficiency of the algorithm as well. our algorithm can deliberately introduce distribution shift to perform (soft) multi-criteria optimization. as a motivating application, we train a neural net to recognize small molecule binders to mnk2 (a map kinase, responsible for cell signaling) which are non-binders to mnk1 (a highly similar protein). we tune the algorithm's parameter so that overall change in holdout loss is negligible, but the selectivity, i.e., the fraction of top 100 mnk2 binders that are mnk1 non-binders, increases from 54\\% to 95\\%, as a result of our reweighing. of the 43 distinct small molecules predicted to be most selective from the enamine catalog, 2 small molecules were experimentally verified to be selective, i.e., they reduced the enzyme activity of mnk2 below 50\\% but not mnk1, at 10$\\mu$m -- a 5\\% success rate.",
"categories": "stat.ml cs.lg q-bio.qm",
"doi": "",
"created": "2024-01-21",
"updated": "",
"authors": [
"pratik worah"
],
"affiliation": [],
"url": "https://arxiv.org/abs/2401.11562"
} | "2024-03-15T07:03:20.799704" | {
"ToxicityFilter": {
"text_to_toxicity_attributes": {
"main.bib": {
"toxicity_score": 0.00719407,
"severe_toxicity_score": 0.0010347366,
"identity_attack_score": 0.0014706649,
"insult_score": 0.0070948736,
"profanity_score": 0.014122557,
"threat_score": 0.006168481,
"sexually_explicit_score": 0.010969753,
"flirtation_score": 0.3015664
},
"main.tex": {
"toxicity_score": 0.012000589,
"severe_toxicity_score": 0.0011539459,
"identity_attack_score": 0.0036812867,
"insult_score": 0.0077028773,
"profanity_score": 0.015386449,
"threat_score": 0.007521313,
"sexually_explicit_score": 0.0122672515,
"flirtation_score": 0.23052543
},
"main.bbl": {
"toxicity_score": 0.011874928,
"severe_toxicity_score": 0.0011348724,
"identity_attack_score": 0.003866276,
"insult_score": 0.0075508766,
"profanity_score": 0.014532468,
"threat_score": 0.007521313,
"sexually_explicit_score": 0.010969753,
"flirtation_score": 0.2762957
},
"neurips_2023.sty": {
"toxicity_score": 0.010429831,
"severe_toxicity_score": 0.00096321106,
"identity_attack_score": 0.003644289,
"insult_score": 0.007341875,
"profanity_score": 0.013849284,
"threat_score": 0.007637825,
"sexually_explicit_score": 0.010438959,
"flirtation_score": 0.36732212
}
},
"reason": null
}
} | {
"num_done": {
"figure": 0,
"algorithm": 3,
"plot": 0
}
} | {
"NonTrivialRenderingFilter": {
"white_pixels_ratio": 93.60778608434285,
"hash": "07079f3e0f9f9f3f",
"most_frequent_color_ratio": 93.60778608434285
}
} | [] | "algorithm" | "6198b44e-7ef3-4092-abff-15603e4a2143" | 681 | easy |
|
\begin{algorithmic}[1]
\Require current node $u$, candidate node $v$, Walker $W$, {\sf HuGE} parameter $\mu$
\Ensure walker state updates
{\flushleft{{\bf sendStateQuery($u$, $v$, $W$)}}} %//{submit the walker-to-vertex query messages and process the state queries}
\State{$P(u,v) = Z\left(\frac{1}{deg(u)-Cm(u, v)}\cdot \max \left\{\frac{deg(u)}{deg(v)}, \frac{deg(v)}{deg(u)} \right\} \right)$} // Eq.~\ref{accept_CNHRW}
{\flushleft{{\bf getStateQueryResult($W, P(u,v)$)}}} %// {return results to querying walkers for retrieving the state and decide sampling outcome}
\State{generate a random number $\eta \in\left[0,1\right]$}
\If{$P(u,v)> \eta $}
\State{$W.path$.append($v$), $W.cur$ = $v$, $W.steps$ ++}
\State{$L$ = $W.steps$}
\State compute $H(W)$ and $R\left(H(W),L\right)$ // Eq.~\ref{path_entropy}, \ref{path_corr}
\If{$R^2(H(W),L) < \mu$}
\State terminate the walk
\Else
\State{generate another candidate node $t$ of $v$}
\State{sendStateQuery($v$, $t$, $W$)}
\EndIf
\Else
\State{backtrack to $u$ and generate another candidate node $v'$ of $u$}
\State{sendStateQuery($u$, $v'$, $W$)}
\EndIf
\end{algorithmic}
| \begin{algorithmic}
[1]
\Require current node $u$, candidate node $v$, Walker $W$, {\sf HuGE} parameter $\mu$
\Ensure walker state updates
{\flushleft{{\bf sendStateQuery($u$, $v$, $W$)}}} %//{submit the walker-to-vertex query messages and process the state queries}
\State{$P(u,v) = Z\left(\frac{1}{deg(u)-Cm(u, v)}\cdot \max \left\{\frac{deg(u)}{deg(v)}, \frac{deg(v)}{deg(u)} \right\} \right)$} // Eq.~\ref{accept_CNHRW}
{\flushleft{{\bf getStateQueryResult($W, P(u,v)$)}}} %// {return results to querying walkers for retrieving the state and decide sampling outcome}
\State{generate a random number $\eta \in\left[0,1\right]$}
\If{$P(u,v)> \eta $}
\State{$W.path$.append($v$), $W.cur$ = $v$, $W.steps$ ++}
\State{$L$ = $W.steps$}
\State compute $H(W)$ and $R\left(H(W),L\right)$ // Eq.~\ref{path_entropy}, \ref{path_corr}
\If{$R^2(H(W),L) < \mu$}
\State terminate the walk
\Else
\State{generate another candidate node $t$ of $v$}
\State{sendStateQuery($v$, $t$, $W$)}
\EndIf
\Else
\State{backtrack to $u$ and generate another candidate node $v'$ of $u$}
\State{sendStateQuery($u$, $v'$, $W$)}
\EndIf
\end{algorithmic} | "https://arxiv.org/src/2303.15702" | "2303.15702.tar.gz" | "2024-02-25" | {
"title": "distributed graph embedding with information-oriented random walks",
"id": "2303.15702",
"abstract": "graph embedding maps graph nodes to low-dimensional vectors, and is widely adopted in machine learning tasks. the increasing availability of billion-edge graphs underscores the importance of learning efficient and effective embeddings on large graphs, such as link prediction on twitter with over one billion edges. most existing graph embedding methods fall short of reaching high data scalability. in this paper, we present a general-purpose, distributed, information-centric random walk-based graph embedding framework, distger, which can scale to embed billion-edge graphs. distger incrementally computes information-centric random walks. it further leverages a multi-proximity-aware, streaming, parallel graph partitioning strategy, simultaneously achieving high local partition quality and excellent workload balancing across machines. distger also improves the distributed skip-gram learning model to generate node embeddings by optimizing the access locality, cpu throughput, and synchronization efficiency. experiments on real-world graphs demonstrate that compared to state-of-the-art distributed graph embedding frameworks, including knightking, distdgl, and pytorch-biggraph, distger exhibits 2.33x-129x acceleration, 45% reduction in cross-machines communication, and > 10% effectiveness improvement in downstream tasks.",
"categories": "cs.dc cs.lg",
"doi": "",
"created": "2023-03-27",
"updated": "2024-02-25",
"authors": [
"peng fang",
"arijit khan",
"siqiang luo",
"fang wang",
"dan feng",
"zhenli li",
"wei yin",
"yuchao cao"
],
"affiliation": [],
"url": "https://arxiv.org/abs/2303.15702"
} | "2024-03-15T03:43:03.810720" | {
"ToxicityFilter": {
"text_to_toxicity_attributes": {
"Figures/SG_Pw2v_DSGL_pSGNScc_1.eps": {
"toxicity_score": 0.0061573703,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0013041744,
"insult_score": 0.0064013693,
"profanity_score": 0.012175481,
"threat_score": 0.0060908063,
"sexually_explicit_score": 0.007372146,
"flirtation_score": 0.47139618
},
"Figures/Dist_generality_table_HuGE+.eps": {
"toxicity_score": 0.0058118035,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0011515582,
"insult_score": 0.006344369,
"profanity_score": 0.012175481,
"threat_score": 0.0060196044,
"sexually_explicit_score": 0.0072836806,
"flirtation_score": 0.49011314
},
"macros.tex": {
"toxicity_score": 0.011686437,
"severe_toxicity_score": 0.0014972687,
"identity_attack_score": 0.002034882,
"insult_score": 0.008405882,
"profanity_score": 0.01805087,
"threat_score": 0.0062785195,
"sexually_explicit_score": 0.014213498,
"flirtation_score": 0.26119846
},
"Figures/DSGL_framework_v3_1.eps": {
"toxicity_score": 0.0061573703,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0013041744,
"insult_score": 0.0064013693,
"profanity_score": 0.012175481,
"threat_score": 0.0060908063,
"sexually_explicit_score": 0.007372146,
"flirtation_score": 0.47139618
},
"4-experiments.tex": {
"toxicity_score": 0.017718147,
"severe_toxicity_score": 0.0019931793,
"identity_attack_score": 0.0032003147,
"insult_score": 0.008766884,
"profanity_score": 0.023584666,
"threat_score": 0.0076637166,
"sexually_explicit_score": 0.01792906,
"flirtation_score": 0.39472604
},
"Figures/Dist_sampling_training_Mpad_efficiency.eps": {
"toxicity_score": 0.0058118035,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0011515582,
"insult_score": 0.006344369,
"profanity_score": 0.012175481,
"threat_score": 0.0060196044,
"sexually_explicit_score": 0.0072836806,
"flirtation_score": 0.49011314
},
"Figures/computation_incremental_mechanism_1.eps": {
"toxicity_score": 0.0061573703,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0013041744,
"insult_score": 0.0064013693,
"profanity_score": 0.012175481,
"threat_score": 0.0060908063,
"sexually_explicit_score": 0.007372146,
"flirtation_score": 0.47139618
},
"ACM-Reference-Format.bst": {
"toxicity_score": 0.011120965,
"severe_toxicity_score": 0.0016021729,
"identity_attack_score": 0.0023863618,
"insult_score": 0.00815888,
"profanity_score": 0.016479544,
"threat_score": 0.0060325502,
"sexually_explicit_score": 0.013387818,
"flirtation_score": 0.5040354
},
"acmart.bib": {
"toxicity_score": 0.0055918973,
"severe_toxicity_score": 0.0010633469,
"identity_attack_score": 0.0008185776,
"insult_score": 0.006344369,
"profanity_score": 0.0137468055,
"threat_score": 0.005657123,
"sexually_explicit_score": 0.009613278,
"flirtation_score": 0.24354401
},
"Figures/Dist_scalability_partition.eps": {
"toxicity_score": 0.0058118035,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0011515582,
"insult_score": 0.006344369,
"profanity_score": 0.012175481,
"threat_score": 0.0060196044,
"sexually_explicit_score": 0.0072836806,
"flirtation_score": 0.49011314
},
"Figures/SG_Pw2v_DSGL_pSGNScc-1.eps": {
"toxicity_score": 0.0061573703,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0013041744,
"insult_score": 0.0064013693,
"profanity_score": 0.012175481,
"threat_score": 0.0060908063,
"sexually_explicit_score": 0.007372146,
"flirtation_score": 0.47139618
},
"0-abstract.tex": {
"toxicity_score": 0.012691722,
"severe_toxicity_score": 0.0012874603,
"identity_attack_score": 0.0036812867,
"insult_score": 0.007892879,
"profanity_score": 0.01535229,
"threat_score": 0.007689608,
"sexually_explicit_score": 0.012621114,
"flirtation_score": 0.19561295
},
"5-related.tex": {
"toxicity_score": 0.014765122,
"severe_toxicity_score": 0.0017738342,
"identity_attack_score": 0.002848835,
"insult_score": 0.0081208795,
"profanity_score": 0.020851927,
"threat_score": 0.0073789097,
"sexually_explicit_score": 0.016749516,
"flirtation_score": 0.41871166
},
"main.tex": {
"toxicity_score": 0.007885204,
"severe_toxicity_score": 0.0007581711,
"identity_attack_score": 0.002848835,
"insult_score": 0.006705371,
"profanity_score": 0.011611853,
"threat_score": 0.0070552654,
"sexually_explicit_score": 0.0080798725,
"flirtation_score": 0.4564441
},
"ref.bib": {
"toxicity_score": 0.007602467,
"severe_toxicity_score": 0.0010251999,
"identity_attack_score": 0.002192123,
"insult_score": 0.0065533705,
"profanity_score": 0.012926984,
"threat_score": 0.0064468146,
"sexually_explicit_score": 0.009731233,
"flirtation_score": 0.21777496
},
"1-introduction.tex": {
"toxicity_score": 0.006942749,
"severe_toxicity_score": 0.0007390976,
"identity_attack_score": 0.0022753682,
"insult_score": 0.0064488696,
"profanity_score": 0.012687869,
"threat_score": 0.0066798385,
"sexually_explicit_score": 0.009554301,
"flirtation_score": 0.2300378
},
"Figures/Dist_time_auc.eps": {
"toxicity_score": 0.0058118035,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0011515582,
"insult_score": 0.006344369,
"profanity_score": 0.012175481,
"threat_score": 0.0060196044,
"sexually_explicit_score": 0.0072836806,
"flirtation_score": 0.49011314
},
"Figures/Dist_total_time_partition.eps": {
"toxicity_score": 0.0058118035,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0011515582,
"insult_score": 0.006344369,
"profanity_score": 0.012175481,
"threat_score": 0.0060196044,
"sexually_explicit_score": 0.0072836806,
"flirtation_score": 0.49011314
},
"2-Prelimenaries.tex": {
"toxicity_score": 0.010492661,
"severe_toxicity_score": 0.0008392334,
"identity_attack_score": 0.0030523231,
"insult_score": 0.0071138735,
"profanity_score": 0.013063621,
"threat_score": 0.007327127,
"sexually_explicit_score": 0.010262027,
"flirtation_score": 0.37547684
},
"Figures/Dist_Mpad_streaming_vertex_time.eps": {
"toxicity_score": 0.0058118035,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0011515582,
"insult_score": 0.006344369,
"profanity_score": 0.012175481,
"threat_score": 0.0060196044,
"sexually_explicit_score": 0.0072836806,
"flirtation_score": 0.49011314
},
"Figures/MPGP_gama.eps": {
"toxicity_score": 0.0058118035,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0011515582,
"insult_score": 0.006344369,
"profanity_score": 0.012175481,
"threat_score": 0.0060196044,
"sexually_explicit_score": 0.0072836806,
"flirtation_score": 0.49011314
},
"6-conclusions.tex": {
"toxicity_score": 0.008419261,
"severe_toxicity_score": 0.00081062317,
"identity_attack_score": 0.0023678627,
"insult_score": 0.0066293706,
"profanity_score": 0.012585391,
"threat_score": 0.0068999166,
"sexually_explicit_score": 0.008610667,
"flirtation_score": 0.22679359
},
"Figures/Dist_scalability_datasize.eps": {
"toxicity_score": 0.0058118035,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0011515582,
"insult_score": 0.006344369,
"profanity_score": 0.012175481,
"threat_score": 0.0060196044,
"sexually_explicit_score": 0.0072836806,
"flirtation_score": 0.49011314
},
"Figures/SG_Pw2v_DSGL_pSGNScc.eps": {
"toxicity_score": 0.0061573703,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0013041744,
"insult_score": 0.0064013693,
"profanity_score": 0.012175481,
"threat_score": 0.0060908063,
"sexually_explicit_score": 0.007372146,
"flirtation_score": 0.47139618
},
"3-huger.tex": {
"toxicity_score": 0.01218908,
"severe_toxicity_score": 0.0011444092,
"identity_attack_score": 0.0038292783,
"insult_score": 0.007645877,
"profanity_score": 0.015044857,
"threat_score": 0.006977591,
"sexually_explicit_score": 0.011677479,
"flirtation_score": 0.25947285
},
"Figures/DSGL_framework_v3.eps": {
"toxicity_score": 0.0061573703,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0013041744,
"insult_score": 0.0064013693,
"profanity_score": 0.012175481,
"threat_score": 0.0060908063,
"sexually_explicit_score": 0.007372146,
"flirtation_score": 0.47139618
},
"main.bbl": {
"toxicity_score": 0.011120965,
"severe_toxicity_score": 0.0016021729,
"identity_attack_score": 0.0023863618,
"insult_score": 0.00815888,
"profanity_score": 0.016479544,
"threat_score": 0.0060325502,
"sexually_explicit_score": 0.013387818,
"flirtation_score": 0.5040354
},
"Figures/DistGER__framework_1_1.eps": {
"toxicity_score": 0.0061573703,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0013041744,
"insult_score": 0.0064013693,
"profanity_score": 0.012175481,
"threat_score": 0.0060908063,
"sexually_explicit_score": 0.007372146,
"flirtation_score": 0.47139618
},
"7-appendix.tex": {
"toxicity_score": 0.013571346,
"severe_toxicity_score": 0.0011825562,
"identity_attack_score": 0.004162259,
"insult_score": 0.0075888764,
"profanity_score": 0.014532468,
"threat_score": 0.008039144,
"sexually_explicit_score": 0.012621114,
"flirtation_score": 0.20776823
},
"Figures/Dist_MLC_mac_mic_F1_1.eps": {
"toxicity_score": 0.0058118035,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0011515582,
"insult_score": 0.006344369,
"profanity_score": 0.012175481,
"threat_score": 0.0060196044,
"sexually_explicit_score": 0.0072836806,
"flirtation_score": 0.49011314
},
"acmart.cls": {
"toxicity_score": 0.011120965,
"severe_toxicity_score": 0.0010442734,
"identity_attack_score": 0.0030523231,
"insult_score": 0.0075128763,
"profanity_score": 0.013712646,
"threat_score": 0.0070552654,
"sexually_explicit_score": 0.009554301,
"flirtation_score": 0.38476974
}
},
"reason": null
}
} | {
"num_done": {
"table": 3,
"figure": 0,
"algorithm": 2,
"plot": 0
}
} | {
"NonTrivialRenderingFilter": {
"white_pixels_ratio": 91.99172862862423,
"hash": "01170f1f1f1f3f1f",
"most_frequent_color_ratio": 91.99172862862423
}
} | [] | "algorithm" | "495ba26c-9d13-4916-8708-fb41c8065401" | 1121 | medium |
|
\begin{algorithmic}[1]
\Procedure{ModifiedGD}{$\nabla F, \hat{L}_{i, 0}, \delta_{(i, \cdot)}, R, \theta_{i, 0}, \kappa_{(i,\cdot)}, T^*, \ell, \gamma$}
\State $ \Delta \leftarrow 0 $ \Comment{Measure of predicted decrease of objective}
\For{$j = 0, 1, ..., T^*-1$}
\State $\alpha_{i,j} \leftarrow \delta_{(i,\cdot)} (2||\nabla F(\theta_{i,j})||^3 + ||\nabla F(\theta_{i,j})||^2\hat{L}_{i,j} )^{-1}$ \Comment{Step size computation}
\State $\theta_{i, j+1} \leftarrow \theta_{i,j} - \alpha_{i,j} \nabla F(\theta_{i,j})$ \Comment{Gradient step}
\State $\Delta \leftarrow \Delta - \delta_{(i,\cdot)}^2\left( 4||\nabla F(\theta_{i,j})||^3 + 2\hat{L}_{i,j}||\nabla F(\theta_{i,j}) ||^2 \right)^{-1}$ \Comment{Update predicted decrease}
\If{ $|| \theta_{i,j} - \theta_{i,j+1} || \ge 10^{-10}$ }
\State $\hat{L}_{i,j+1} \leftarrow \Call{UpdateL}{\nabla F, \theta_{i,j}, \theta_{i,j+1}, \hat{L}_{i,j}, \kappa_{(i,\cdot)}, \ell}$ \Comment{Update local Lipschitz estimate}
\Else
\State $\hat{L}_{i,j+1} \leftarrow \hat{L}_{i,j}$
\EndIf
\State $ \delta_{cond} \leftarrow ||\nabla F(\theta_{i,j+1})||^2 \not\in (\delta_{(i,\cdot)}, \gamma\delta_{(i,\cdot)})$
\If{$\delta_{cond}$ or $||\theta_{i,j+1}-\theta_{i,0}|| > R$ or stop condition} \Comment{Check triggering events}
\State \Return{$\theta_{i,j+1},\hat{L}_{i,j+1},\delta_{cond},\Delta$}
\EndIf
\EndFor
\State
\Return{$\theta_{i,T^*},\hat{L}_{i,T^*},\delta_{cond},\Delta$}
\EndProcedure
\end{algorithmic}
| \begin{algorithmic}
[1]
\Procedure{ModifiedGD}{$\nabla F, \hat{L}_{i, 0}, \delta_{(i, \cdot)}, R, \theta_{i, 0}, \kappa_{(i,\cdot)}, T^*, \ell, \gamma$}
\State $ \Delta \leftarrow 0 $ \Comment{Measure of predicted decrease of objective}
\For{$j = 0, 1, ..., T^*-1$}
\State $\alpha_{i,j} \leftarrow \delta_{(i,\cdot)} (2||\nabla F(\theta_{i,j})||^3 + ||\nabla F(\theta_{i,j})||^2\hat{L}_{i,j} )^{-1}$ \Comment{Step size computation}
\State $\theta_{i, j+1} \leftarrow \theta_{i,j} - \alpha_{i,j} \nabla F(\theta_{i,j})$ \Comment{Gradient step}
\State $\Delta \leftarrow \Delta - \delta_{(i,\cdot)}^2\left( 4||\nabla F(\theta_{i,j})||^3 + 2\hat{L}_{i,j}||\nabla F(\theta_{i,j}) ||^2 \right)^{-1}$ \Comment{Update predicted decrease}
\If{ $|| \theta_{i,j} - \theta_{i,j+1} || \ge 10^{-10}$ }
\State $\hat{L}_{i,j+1} \leftarrow \Call{UpdateL}{\nabla F, \theta_{i,j}, \theta_{i,j+1}, \hat{L}_{i,j}, \kappa_{(i,\cdot)}, \ell}$ \Comment{Update local Lipschitz estimate}
\Else
\State $\hat{L}_{i,j+1} \leftarrow \hat{L}_{i,j}$
\EndIf
\State $ \delta_{cond} \leftarrow ||\nabla F(\theta_{i,j+1})||^2 \not\in (\delta_{(i,\cdot)}, \gamma\delta_{(i,\cdot)})$
\If{$\delta_{cond}$ or $||\theta_{i,j+1}-\theta_{i,0}|| > R$ or stop condition} \Comment{Check triggering events}
\State \Return{$\theta_{i,j+1},\hat{L}_{i,j+1},\delta_{cond},\Delta$}
\EndIf
\EndFor
\State
\Return{$\theta_{i,T^*},\hat{L}_{i,T^*},\delta_{cond},\Delta$}
\EndProcedure
\end{algorithmic} | "https://arxiv.org/src/2309.10894" | "2309.10894.tar.gz" | "2024-02-15" | {
"title": "a novel gradient methodology with economical objective function evaluations for data science applications",
"id": "2309.10894",
"abstract": "gradient methods are experiencing a growth in methodological and theoretical developments owing to the challenges of optimization problems arising in data science. focusing on data science applications with expensive objective function evaluations yet inexpensive gradient function evaluations, gradient methods that never make objective function evaluations are either being rejuvenated or actively developed. however, as we show, such gradient methods are all susceptible to catastrophic divergence under realistic conditions for data science applications. in light of this, gradient methods which make use of objective function evaluations become more appealing, yet, as we show, can result in an exponential increase in objective evaluations between accepted iterates. as a result, existing gradient methods are poorly suited to the needs of optimization problems arising from data science. in this work, we address this gap by developing a generic methodology that economically uses objective function evaluations in a problem-driven manner to prevent catastrophic divergence and avoid an explosion in objective evaluations between accepted iterates. our methodology allows for specific procedures that can make use of specific step size selection methodologies or search direction strategies, and we develop a novel step size selection methodology that is well-suited to data science applications. we show that a procedure resulting from our methodology is highly competitive with standard optimization methods on cutest test problems. we then show a procedure resulting from our methodology is highly favorable relative to standard optimization methods on optimization problems arising in our target data science applications. thus, we provide a novel gradient methodology that is better suited to optimization problems arising in data science.",
"categories": "math.oc stat.co",
"doi": "",
"created": "2023-09-19",
"updated": "2024-02-15",
"authors": [
"christian varner",
"vivak patel"
],
"affiliation": [],
"url": "https://arxiv.org/abs/2309.10894"
} | "2024-03-15T05:23:50.845023" | {
"ToxicityFilter": {
"text_to_toxicity_attributes": {
"table/novel-step-size-param-table.tex": {
"toxicity_score": 0.011309455,
"severe_toxicity_score": 0.0012969971,
"identity_attack_score": 0.0034592997,
"insult_score": 0.0074558756,
"profanity_score": 0.015659723,
"threat_score": 0.007547205,
"sexually_explicit_score": 0.013564749,
"flirtation_score": 0.2449079
},
"section/algo_psuedocode/general_algorithm.tex": {
"toxicity_score": 0.014953613,
"severe_toxicity_score": 0.0016403198,
"identity_attack_score": 0.00414376,
"insult_score": 0.00810188,
"profanity_score": 0.01805087,
"threat_score": 0.008116818,
"sexually_explicit_score": 0.014272475,
"flirtation_score": 0.27245644
},
"section/algo_psuedocode/outer_loop.tex": {
"toxicity_score": 0.011246625,
"severe_toxicity_score": 0.0012493134,
"identity_attack_score": 0.0035147965,
"insult_score": 0.0074368757,
"profanity_score": 0.015283971,
"threat_score": 0.007598988,
"sexually_explicit_score": 0.011913388,
"flirtation_score": 0.23316474
},
"data/cutest/all_rel_change_gradient_calls.csv": {
"toxicity_score": 0.0048065186,
"severe_toxicity_score": 0.0011062622,
"identity_attack_score": 0.00087407435,
"insult_score": 0.006021367,
"profanity_score": 0.012380436,
"threat_score": 0.005809236,
"sexually_explicit_score": 0.00896453,
"flirtation_score": 0.3112504
},
"data/cutest/all_rel_change_function_calls.csv": {
"toxicity_score": 0.0048065186,
"severe_toxicity_score": 0.0011062622,
"identity_attack_score": 0.00087407435,
"insult_score": 0.006021367,
"profanity_score": 0.012380436,
"threat_score": 0.005809236,
"sexually_explicit_score": 0.00896453,
"flirtation_score": 0.3112504
},
"data/gee/total_evals_leaf.csv": {
"toxicity_score": 0.014450971,
"severe_toxicity_score": 0.0011968613,
"identity_attack_score": 0.0032188136,
"insult_score": 0.008557882,
"profanity_score": 0.013405213,
"threat_score": 0.008401625,
"sexually_explicit_score": 0.01020305,
"flirtation_score": 0.35794142
},
"section/evaluation_explosion/preliminaries.tex": {
"toxicity_score": 0.011623607,
"severe_toxicity_score": 0.00096321106,
"identity_attack_score": 0.0034408006,
"insult_score": 0.007360875,
"profanity_score": 0.013439372,
"threat_score": 0.007365964,
"sexually_explicit_score": 0.010615891,
"flirtation_score": 0.33654565
},
"section/smoothness-of-ds-problems/overview.tex": {
"toxicity_score": 0.020960633,
"severe_toxicity_score": 0.0011253357,
"identity_attack_score": 0.0051797,
"insult_score": 0.0107048955,
"profanity_score": 0.016103793,
"threat_score": 0.008000307,
"sexually_explicit_score": 0.014626338,
"flirtation_score": 0.17700504
},
"section/catastrophic_divergence/nesterov_acceleration.tex": {
"toxicity_score": 0.013131535,
"severe_toxicity_score": 0.0010538101,
"identity_attack_score": 0.0052166977,
"insult_score": 0.007721877,
"profanity_score": 0.0147374235,
"threat_score": 0.007974415,
"sexually_explicit_score": 0.013564749,
"flirtation_score": 0.19002186
},
"section/algorithm.tex": {
"toxicity_score": 0.036634352,
"severe_toxicity_score": 0.002193451,
"identity_attack_score": 0.011543332,
"insult_score": 0.012110904,
"profanity_score": 0.02303812,
"threat_score": 0.014220826,
"sexually_explicit_score": 0.027365407,
"flirtation_score": 0.22199428
},
"ref.bib": {
"toxicity_score": 0.010115679,
"severe_toxicity_score": 0.0011396408,
"identity_attack_score": 0.002293867,
"insult_score": 0.007360875,
"profanity_score": 0.0137468055,
"threat_score": 0.006925808,
"sexually_explicit_score": 0.009672256,
"flirtation_score": 0.23720506
},
"section/notation.tex": {
"toxicity_score": 0.01024134,
"severe_toxicity_score": 0.0014209747,
"identity_attack_score": 0.0029043318,
"insult_score": 0.0071138735,
"profanity_score": 0.0157622,
"threat_score": 0.007197669,
"sexually_explicit_score": 0.013564749,
"flirtation_score": 0.2506604
},
"section/catastrophic_divergence/adaptive_scaled_tr.tex": {
"toxicity_score": 0.017089844,
"severe_toxicity_score": 0.001206398,
"identity_attack_score": 0.005512681,
"insult_score": 0.009336887,
"profanity_score": 0.015488927,
"threat_score": 0.00814271,
"sexually_explicit_score": 0.01480327,
"flirtation_score": 0.3277508
},
"section/evaluation_explosion/cubic_regularized_newton.tex": {
"toxicity_score": 0.010681152,
"severe_toxicity_score": 0.00062942505,
"identity_attack_score": 0.002830336,
"insult_score": 0.007493876,
"profanity_score": 0.011902207,
"threat_score": 0.006485652,
"sexually_explicit_score": 0.007106749,
"flirtation_score": 0.21416461
},
"section/catastrophic_divergence.tex": {
"toxicity_score": 0.0056233127,
"severe_toxicity_score": 0.00068187714,
"identity_attack_score": 0.0016649036,
"insult_score": 0.0061543677,
"profanity_score": 0.012038844,
"threat_score": 0.006330303,
"sexually_explicit_score": 0.008846575,
"flirtation_score": 0.3247941
},
"section/catastrophic_divergence/wngrad-div.tex": {
"toxicity_score": 0.029917045,
"severe_toxicity_score": 0.0014877319,
"identity_attack_score": 0.0070665907,
"insult_score": 0.011958904,
"profanity_score": 0.017914234,
"threat_score": 0.009230154,
"sexually_explicit_score": 0.015805881,
"flirtation_score": 0.39471897
},
"data/gee/fieller_categorization.csv": {
"toxicity_score": 0.011120965,
"severe_toxicity_score": 0.0008916855,
"identity_attack_score": 0.002885833,
"insult_score": 0.007892879,
"profanity_score": 0.012722028,
"threat_score": 0.006977591,
"sexually_explicit_score": 0.009023507,
"flirtation_score": 0.40000224
},
"figure/gee_wedderburn/evaluations_boxplots.tex": {
"toxicity_score": 0.056016337,
"severe_toxicity_score": 0.008049011,
"identity_attack_score": 0.0058086636,
"insult_score": 0.01819439,
"profanity_score": 0.11354194,
"threat_score": 0.008285114,
"sexually_explicit_score": 0.06306043,
"flirtation_score": 0.21970871
},
"section/smoothness-of-ds-problems/poisson-reg/poisson-reg.tex": {
"toxicity_score": 0.022139108,
"severe_toxicity_score": 0.0011014938,
"identity_attack_score": 0.0034592997,
"insult_score": 0.010096892,
"profanity_score": 0.013712646,
"threat_score": 0.007832011,
"sexually_explicit_score": 0.0101440735,
"flirtation_score": 0.23723446
},
"data/gee/func_evals_fieller.csv": {
"toxicity_score": 0.014576632,
"severe_toxicity_score": 0.0012493134,
"identity_attack_score": 0.003144818,
"insult_score": 0.008519882,
"profanity_score": 0.013849284,
"threat_score": 0.0083886795,
"sexually_explicit_score": 0.010969753,
"flirtation_score": 0.3583591
},
"section/evaluation_explosion/dynamic_method.tex": {
"toxicity_score": 0.019854378,
"severe_toxicity_score": 0.0013637543,
"identity_attack_score": 0.0056236745,
"insult_score": 0.009146886,
"profanity_score": 0.016479544,
"threat_score": 0.008815889,
"sexually_explicit_score": 0.015805881,
"flirtation_score": 0.23163475
},
"data/gee/func_evals_leaf.csv": {
"toxicity_score": 0.014450971,
"severe_toxicity_score": 0.0011968613,
"identity_attack_score": 0.0032188136,
"insult_score": 0.008557882,
"profanity_score": 0.013405213,
"threat_score": 0.008401625,
"sexually_explicit_score": 0.01020305,
"flirtation_score": 0.35794142
},
"section/algo_psuedocode/novel-step-size-procedure.tex": {
"toxicity_score": 0.014953613,
"severe_toxicity_score": 0.0016403198,
"identity_attack_score": 0.00414376,
"insult_score": 0.00810188,
"profanity_score": 0.01805087,
"threat_score": 0.008116818,
"sexually_explicit_score": 0.014272475,
"flirtation_score": 0.27245644
},
"data/gee/fieller_cpu_data.csv": {
"toxicity_score": 0.018723432,
"severe_toxicity_score": 0.0029182434,
"identity_attack_score": 0.002034882,
"insult_score": 0.009640889,
"profanity_score": 0.015147334,
"threat_score": 0.008764107,
"sexually_explicit_score": 0.015334064,
"flirtation_score": 0.25993884
},
"table/multiple_objective_evaluation_table.tex": {
"toxicity_score": 0.012566062,
"severe_toxicity_score": 0.0015068054,
"identity_attack_score": 0.0038292783,
"insult_score": 0.0077598775,
"profanity_score": 0.017367685,
"threat_score": 0.00780612,
"sexually_explicit_score": 0.014862247,
"flirtation_score": 0.22981189
},
"figure/first_order_relative_change/total_calls.tex": {
"toxicity_score": 0.028856417,
"severe_toxicity_score": 0.0032615662,
"identity_attack_score": 0.0054756827,
"insult_score": 0.011160898,
"profanity_score": 0.033144772,
"threat_score": 0.009230154,
"sexually_explicit_score": 0.034442667,
"flirtation_score": 0.36386168
},
"figure/second_order_relative_change/total_calls.tex": {
"toxicity_score": 0.033334624,
"severe_toxicity_score": 0.004043579,
"identity_attack_score": 0.0062526376,
"insult_score": 0.011122898,
"profanity_score": 0.03715288,
"threat_score": 0.011146127,
"sexually_explicit_score": 0.040446278,
"flirtation_score": 0.3976111
},
"data/gee/grad_evals_leaf.csv": {
"toxicity_score": 0.014450971,
"severe_toxicity_score": 0.0011968613,
"identity_attack_score": 0.0032188136,
"insult_score": 0.008557882,
"profanity_score": 0.013405213,
"threat_score": 0.008401625,
"sexually_explicit_score": 0.01020305,
"flirtation_score": 0.35794142
},
"figure/cpu_time_cutest/second_order_cpu_time.tex": {
"toxicity_score": 0.0131943645,
"severe_toxicity_score": 0.0012397766,
"identity_attack_score": 0.0043102503,
"insult_score": 0.008329881,
"profanity_score": 0.016889455,
"threat_score": 0.008000307,
"sexually_explicit_score": 0.011441571,
"flirtation_score": 0.48778152
},
"figure/gee_wedderburn/cpu_comp_boxplots.tex": {
"toxicity_score": 0.056016337,
"severe_toxicity_score": 0.008049011,
"identity_attack_score": 0.0058086636,
"insult_score": 0.01819439,
"profanity_score": 0.11354194,
"threat_score": 0.008285114,
"sexually_explicit_score": 0.06306043,
"flirtation_score": 0.21970871
},
"section/catastrophic_divergence/constant_step.tex": {
"toxicity_score": 0.0143253105,
"severe_toxicity_score": 0.0011444092,
"identity_attack_score": 0.0034223017,
"insult_score": 0.007664877,
"profanity_score": 0.014190876,
"threat_score": 0.0076766624,
"sexually_explicit_score": 0.012385205,
"flirtation_score": 0.427231
},
"figure/gee_fiellercreasy/cpu_comp_boxplots.tex": {
"toxicity_score": 0.056016337,
"severe_toxicity_score": 0.008049011,
"identity_attack_score": 0.0058086636,
"insult_score": 0.01819439,
"profanity_score": 0.11354194,
"threat_score": 0.008285114,
"sexually_explicit_score": 0.06306043,
"flirtation_score": 0.21970871
},
"figure/second_order_relative_change/gradient_calls.tex": {
"toxicity_score": 0.033334624,
"severe_toxicity_score": 0.004043579,
"identity_attack_score": 0.0062526376,
"insult_score": 0.011122898,
"profanity_score": 0.03715288,
"threat_score": 0.011146127,
"sexually_explicit_score": 0.040446278,
"flirtation_score": 0.3976111
},
"section/algo_psuedocode/local_lipschitz_est.tex": {
"toxicity_score": 0.014953613,
"severe_toxicity_score": 0.0016403198,
"identity_attack_score": 0.00414376,
"insult_score": 0.00810188,
"profanity_score": 0.01805087,
"threat_score": 0.008116818,
"sexually_explicit_score": 0.014272475,
"flirtation_score": 0.27245644
},
"section/algo_psuedocode/inner_loop.tex": {
"toxicity_score": 0.01225191,
"severe_toxicity_score": 0.0012683868,
"identity_attack_score": 0.0037737815,
"insult_score": 0.0074558756,
"profanity_score": 0.015488927,
"threat_score": 0.007935578,
"sexually_explicit_score": 0.012031343,
"flirtation_score": 0.1759681
},
"figure/objective_threshold_diagram.tex": {
"toxicity_score": 0.056016337,
"severe_toxicity_score": 0.008049011,
"identity_attack_score": 0.0058086636,
"insult_score": 0.01819439,
"profanity_score": 0.11354194,
"threat_score": 0.008285114,
"sexually_explicit_score": 0.06306043,
"flirtation_score": 0.21970871
},
"section/catastrophic_divergence/barzilai_borwein.tex": {
"toxicity_score": 0.015079274,
"severe_toxicity_score": 0.00092983246,
"identity_attack_score": 0.004125261,
"insult_score": 0.00813988,
"profanity_score": 0.0127561875,
"threat_score": 0.0074824756,
"sexually_explicit_score": 0.010438959,
"flirtation_score": 0.37749934
},
"figure/catastrophic_divergence_building_function.tex": {
"toxicity_score": 0.056016337,
"severe_toxicity_score": 0.008049011,
"identity_attack_score": 0.0058086636,
"insult_score": 0.01819439,
"profanity_score": 0.11354194,
"threat_score": 0.008285114,
"sexually_explicit_score": 0.06306043,
"flirtation_score": 0.21970871
},
"section/evaluation_explosion/armijo.tex": {
"toxicity_score": 0.01024134,
"severe_toxicity_score": 0.00096321106,
"identity_attack_score": 0.0019238886,
"insult_score": 0.0077028773,
"profanity_score": 0.013302735,
"threat_score": 0.006051969,
"sexually_explicit_score": 0.011382594,
"flirtation_score": 0.33172962
},
"section/smoothness-of-ds-problems/correlation-via-gee/correlation-via-gee.tex": {
"toxicity_score": 0.011937759,
"severe_toxicity_score": 0.00092983246,
"identity_attack_score": 0.003866276,
"insult_score": 0.0074368757,
"profanity_score": 0.013610168,
"threat_score": 0.007301235,
"sexually_explicit_score": 0.010615891,
"flirtation_score": 0.24296696
},
"figure/second_order_relative_change/function_calls.tex": {
"toxicity_score": 0.033334624,
"severe_toxicity_score": 0.004043579,
"identity_attack_score": 0.0062526376,
"insult_score": 0.011122898,
"profanity_score": 0.03715288,
"threat_score": 0.011146127,
"sexually_explicit_score": 0.040446278,
"flirtation_score": 0.3976111
},
"section/evaluation_explosion/adaptive_cubic_regularization.tex": {
"toxicity_score": 0.008796243,
"severe_toxicity_score": 0.0006246567,
"identity_attack_score": 0.0027748393,
"insult_score": 0.0068003717,
"profanity_score": 0.011184863,
"threat_score": 0.006589218,
"sexually_explicit_score": 0.006516977,
"flirtation_score": 0.1969631
},
"section/results-cutest.tex": {
"toxicity_score": 0.016964182,
"severe_toxicity_score": 0.0012207031,
"identity_attack_score": 0.0051427023,
"insult_score": 0.009127886,
"profanity_score": 0.017162729,
"threat_score": 0.008065036,
"sexually_explicit_score": 0.014095544,
"flirtation_score": 0.44243842
},
"figure/first_order_relative_change/gradient_calls.tex": {
"toxicity_score": 0.028856417,
"severe_toxicity_score": 0.0032615662,
"identity_attack_score": 0.0054756827,
"insult_score": 0.011160898,
"profanity_score": 0.033144772,
"threat_score": 0.009230154,
"sexually_explicit_score": 0.034442667,
"flirtation_score": 0.36386168
},
"GD_Triggers.tex": {
"toxicity_score": 0.010304171,
"severe_toxicity_score": 0.0010061264,
"identity_attack_score": 0.0032558115,
"insult_score": 0.007189874,
"profanity_score": 0.014259194,
"threat_score": 0.0072882893,
"sexually_explicit_score": 0.0108517995,
"flirtation_score": 0.18085068
},
"table/objective_free_table.tex": {
"toxicity_score": 0.012566062,
"severe_toxicity_score": 0.0015068054,
"identity_attack_score": 0.0038292783,
"insult_score": 0.0077598775,
"profanity_score": 0.017367685,
"threat_score": 0.00780612,
"sexually_explicit_score": 0.014862247,
"flirtation_score": 0.22981189
},
"section/algo_psuedocode/naive_algorithm.tex": {
"toxicity_score": 0.016021729,
"severe_toxicity_score": 0.0018501282,
"identity_attack_score": 0.0047727237,
"insult_score": 0.008272881,
"profanity_score": 0.020373698,
"threat_score": 0.008427517,
"sexually_explicit_score": 0.016159745,
"flirtation_score": 0.20608959
},
"data/gee/total_evals_fieller.csv": {
"toxicity_score": 0.014576632,
"severe_toxicity_score": 0.0012493134,
"identity_attack_score": 0.003144818,
"insult_score": 0.008519882,
"profanity_score": 0.013849284,
"threat_score": 0.0083886795,
"sexually_explicit_score": 0.010969753,
"flirtation_score": 0.3583591
},
"figure/gee_fiellercreasy/evaluations_boxplots.tex": {
"toxicity_score": 0.056016337,
"severe_toxicity_score": 0.008049011,
"identity_attack_score": 0.0058086636,
"insult_score": 0.01819439,
"profanity_score": 0.11354194,
"threat_score": 0.008285114,
"sexually_explicit_score": 0.06306043,
"flirtation_score": 0.21970871
},
"data/cutest/all_cpu_won.csv": {
"toxicity_score": 0.014576632,
"severe_toxicity_score": 0.0009393692,
"identity_attack_score": 0.0018498929,
"insult_score": 0.008747884,
"profanity_score": 0.010569996,
"threat_score": 0.007314181,
"sexually_explicit_score": 0.0049245935,
"flirtation_score": 0.29574385
},
"data/gee/leaf_cpu_data.csv": {
"toxicity_score": 0.024967449,
"severe_toxicity_score": 0.0014400482,
"identity_attack_score": 0.0023031165,
"insult_score": 0.013326911,
"profanity_score": 0.015113175,
"threat_score": 0.0076766624,
"sexually_explicit_score": 0.010556913,
"flirtation_score": 0.2429553
},
"section/smoothness-of-ds-problems/poisson-reg/smoothness-proof.tex": {
"toxicity_score": 0.009864358,
"severe_toxicity_score": 0.0008201599,
"identity_attack_score": 0.0020996283,
"insult_score": 0.0068763723,
"profanity_score": 0.012346277,
"threat_score": 0.006763986,
"sexually_explicit_score": 0.009082484,
"flirtation_score": 0.22990656
},
"section/catastrophic_divergence/polyak.tex": {
"toxicity_score": 0.01237757,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0030153254,
"insult_score": 0.0075888764,
"profanity_score": 0.011970525,
"threat_score": 0.007068211,
"sexually_explicit_score": 0.0080798725,
"flirtation_score": 0.20474647
},
"section/catastrophic_divergence/bregman_distance.tex": {
"toxicity_score": 0.009487377,
"severe_toxicity_score": 0.0007724762,
"identity_attack_score": 0.0033298072,
"insult_score": 0.006895372,
"profanity_score": 0.013063621,
"threat_score": 0.0069516995,
"sexually_explicit_score": 0.010321004,
"flirtation_score": 0.41113064
},
"figure/cpu_time_cutest/first_order_cpu_time.tex": {
"toxicity_score": 0.031331215,
"severe_toxicity_score": 0.0043296814,
"identity_attack_score": 0.004439743,
"insult_score": 0.011540901,
"profanity_score": 0.054437835,
"threat_score": 0.007948523,
"sexually_explicit_score": 0.043803066,
"flirtation_score": 0.35417965
},
"section/results-gee.tex": {
"toxicity_score": 0.014136819,
"severe_toxicity_score": 0.00096797943,
"identity_attack_score": 0.0043102503,
"insult_score": 0.00813988,
"profanity_score": 0.015386449,
"threat_score": 0.0076119336,
"sexually_explicit_score": 0.011854411,
"flirtation_score": 0.545385
},
"section/catastrophic_divergence/preliminaries.tex": {
"toxicity_score": 0.013257195,
"severe_toxicity_score": 0.00094890594,
"identity_attack_score": 0.004347248,
"insult_score": 0.007835878,
"profanity_score": 0.013678487,
"threat_score": 0.007741391,
"sexually_explicit_score": 0.010497936,
"flirtation_score": 0.27346042
},
"data/cutest/all_cpu_lost.csv": {
"toxicity_score": 0.014576632,
"severe_toxicity_score": 0.0009393692,
"identity_attack_score": 0.0018498929,
"insult_score": 0.008747884,
"profanity_score": 0.010569996,
"threat_score": 0.007314181,
"sexually_explicit_score": 0.0049245935,
"flirtation_score": 0.29574385
},
"table/gee-terminal-iterate-cat.tex": {
"toxicity_score": 0.01024134,
"severe_toxicity_score": 0.0014209747,
"identity_attack_score": 0.0029043318,
"insult_score": 0.0071138735,
"profanity_score": 0.0157622,
"threat_score": 0.007197669,
"sexually_explicit_score": 0.013564749,
"flirtation_score": 0.2506604
},
"table/gee-experiment-table.tex": {
"toxicity_score": 0.015833238,
"severe_toxicity_score": 0.0015163422,
"identity_attack_score": 0.0050317086,
"insult_score": 0.008766884,
"profanity_score": 0.017572641,
"threat_score": 0.008077981,
"sexually_explicit_score": 0.016277699,
"flirtation_score": 0.19330522
},
"section/problem_formulation.tex": {
"toxicity_score": 0.008859074,
"severe_toxicity_score": 0.0007724762,
"identity_attack_score": 0.003348306,
"insult_score": 0.006819372,
"profanity_score": 0.011355659,
"threat_score": 0.0070552654,
"sexually_explicit_score": 0.0063695344,
"flirtation_score": 0.27690822
},
"section/conclusion.tex": {
"toxicity_score": 0.010681152,
"severe_toxicity_score": 0.0006055832,
"identity_attack_score": 0.0027933381,
"insult_score": 0.0075508766,
"profanity_score": 0.011082385,
"threat_score": 0.0066668927,
"sexually_explicit_score": 0.005897717,
"flirtation_score": 0.20846651
},
"section/catastrophic_divergence/negative_curvature.tex": {
"toxicity_score": 0.0154562555,
"severe_toxicity_score": 0.0010728836,
"identity_attack_score": 0.0043102503,
"insult_score": 0.007873878,
"profanity_score": 0.015079016,
"threat_score": 0.008401625,
"sexually_explicit_score": 0.01250316,
"flirtation_score": 0.30951333
},
"section/abstract.tex": {
"toxicity_score": 0.008859074,
"severe_toxicity_score": 0.0005078316,
"identity_attack_score": 0.0026638457,
"insult_score": 0.006952373,
"profanity_score": 0.010074687,
"threat_score": 0.00636914,
"sexually_explicit_score": 0.0046002194,
"flirtation_score": 0.17139499
},
"section/smoothness-of-ds-problems/nn/nn.tex": {
"toxicity_score": 0.017969469,
"severe_toxicity_score": 0.0009965897,
"identity_attack_score": 0.006178642,
"insult_score": 0.009868891,
"profanity_score": 0.015283971,
"threat_score": 0.007689608,
"sexually_explicit_score": 0.012739069,
"flirtation_score": 0.24728048
},
"GD_Triggers.bbl": {
"toxicity_score": 0.017843807,
"severe_toxicity_score": 0.0013160706,
"identity_attack_score": 0.00362579,
"insult_score": 0.009374888,
"profanity_score": 0.017299367,
"threat_score": 0.00746953,
"sexually_explicit_score": 0.013800657,
"flirtation_score": 0.47433925
},
"section/introduction.tex": {
"toxicity_score": 0.0131943645,
"severe_toxicity_score": 0.00096797943,
"identity_attack_score": 0.0045322375,
"insult_score": 0.007778878,
"profanity_score": 0.013576009,
"threat_score": 0.00756015,
"sexually_explicit_score": 0.009318393,
"flirtation_score": 0.21079259
},
"figure/first_order_relative_change/function_calls.tex": {
"toxicity_score": 0.028856417,
"severe_toxicity_score": 0.0032615662,
"identity_attack_score": 0.0054756827,
"insult_score": 0.011160898,
"profanity_score": 0.033144772,
"threat_score": 0.009230154,
"sexually_explicit_score": 0.034442667,
"flirtation_score": 0.36386168
},
"table/cutest-experiment-table.tex": {
"toxicity_score": 0.015833238,
"severe_toxicity_score": 0.0015163422,
"identity_attack_score": 0.0050317086,
"insult_score": 0.008766884,
"profanity_score": 0.017572641,
"threat_score": 0.008077981,
"sexually_explicit_score": 0.016277699,
"flirtation_score": 0.19330522
},
"section/smoothness_canonical_ds_problems.tex": {
"toxicity_score": 0.013634177,
"severe_toxicity_score": 0.00094890594,
"identity_attack_score": 0.0035517942,
"insult_score": 0.008291881,
"profanity_score": 0.014293353,
"threat_score": 0.007314181,
"sexually_explicit_score": 0.013505772,
"flirtation_score": 0.30319104
},
"section/catastrophic_divergence/lipschitz_approximation.tex": {
"toxicity_score": 0.01225191,
"severe_toxicity_score": 0.0011301041,
"identity_attack_score": 0.0030338243,
"insult_score": 0.0076838774,
"profanity_score": 0.015386449,
"threat_score": 0.007832011,
"sexually_explicit_score": 0.013800657,
"flirtation_score": 0.50405544
},
"section/evaluation_explosion.tex": {
"toxicity_score": 0.019351736,
"severe_toxicity_score": 0.0015830994,
"identity_attack_score": 0.0039772694,
"insult_score": 0.008367881,
"profanity_score": 0.017845914,
"threat_score": 0.009307829,
"sexually_explicit_score": 0.018164968,
"flirtation_score": 0.35859555
},
"data/gee/grad_evals_fieller.csv": {
"toxicity_score": 0.014576632,
"severe_toxicity_score": 0.0012493134,
"identity_attack_score": 0.003144818,
"insult_score": 0.008519882,
"profanity_score": 0.013849284,
"threat_score": 0.0083886795,
"sexually_explicit_score": 0.010969753,
"flirtation_score": 0.3583591
},
"section/novel-step-size.tex": {
"toxicity_score": 0.012063419,
"severe_toxicity_score": 0.0009441376,
"identity_attack_score": 0.0042732526,
"insult_score": 0.007930879,
"profanity_score": 0.014805742,
"threat_score": 0.007598988,
"sexually_explicit_score": 0.012798046,
"flirtation_score": 0.41932905
},
"table/data_science_problems_table.tex": {
"toxicity_score": 0.011309455,
"severe_toxicity_score": 0.0012969971,
"identity_attack_score": 0.0034592997,
"insult_score": 0.0074558756,
"profanity_score": 0.015659723,
"threat_score": 0.007547205,
"sexually_explicit_score": 0.013564749,
"flirtation_score": 0.2449079
},
"section/smoothness-of-ds-problems/factor-analysis/factor-analysis.tex": {
"toxicity_score": 0.008984734,
"severe_toxicity_score": 0.0005698204,
"identity_attack_score": 0.002330865,
"insult_score": 0.006885872,
"profanity_score": 0.011082385,
"threat_score": 0.0067445673,
"sexually_explicit_score": 0.006222091,
"flirtation_score": 0.16150479
},
"data/cutest/all_rel_change_total_calls.csv": {
"toxicity_score": 0.0048065186,
"severe_toxicity_score": 0.0011062622,
"identity_attack_score": 0.00087407435,
"insult_score": 0.006021367,
"profanity_score": 0.012380436,
"threat_score": 0.005809236,
"sexually_explicit_score": 0.00896453,
"flirtation_score": 0.3112504
}
},
"reason": null
}
} | {
"num_done": {
"figure": 0,
"algorithm": 3,
"plot": 1
}
} | {
"NonTrivialRenderingFilter": {
"white_pixels_ratio": 92.98582783127969,
"hash": "038788939f93879f",
"most_frequent_color_ratio": 92.98582783127969
}
} | [] | "algorithm" | "d5824813-2875-4568-bb05-f16712f12f47" | 1447 | hard |
|
\begin{algorithmic}[1]
\State \textbf{Input:} Stock data for two assets $S_1$ and $S_2$, buy threshold, sell threshold
\State \textbf{Output:} Trade signals for pairs trading
\State
\Procedure{Compute Hedge Ratio}{data1, data2}
\State model $\gets$ perform OLS regression (data1, data2)
\State \Return model.params$[1]$
\EndProcedure
\State
\Procedure{Initialize}{fast, slow}
\State hedge$\_$ratio $\gets$ \Call{Compute Hedge Ratio}{$S_1$, $S_2$}
\State Calculate spread $\gets$ $S_1$$-$hedge$\_$ratio $\times$ $S_2$
\State fast$\_$ema $\gets$ \Call{EMA}{spread, fast}
\State slow$\_$ema $\gets$ \Call{EMA}{spread, slow}
\State apo$\_$spread $\gets$ fast$\_$ema$-$slow$\_$ema
\State position $\gets 0$
\EndProcedure
\State
\Procedure{Next}{buy threshold, sell threshold}
\State \textbf{if}{~apo$\_$spread $<$ buy$\_$threshold} \textbf{then}
\State \hspace{1cm} Execute Buy for $S_1$ and Sell Short for $S_2$
\State \textbf{else if}{apo$\_$spread $>$ sell$\_$threshold} \textbf{then}
\State \hspace{1cm} Execute Sell Short for $S_1$ and Buy for $S_2$
\State \textbf{end if}
\EndProcedure
\end{algorithmic}
| \begin{algorithmic}
[1]
\State \textbf{Input:} Stock data for two assets $S_1$ and $S_2$, buy threshold, sell threshold
\State \textbf{Output:} Trade signals for pairs trading
\State
\Procedure{Compute Hedge Ratio}{data1, data2}
\State model $\gets$ perform OLS regression (data1, data2)
\State \Return model.params$[1]$
\EndProcedure
\State
\Procedure{Initialize}{fast, slow}
\State hedge$\_$ratio $\gets$ \Call{Compute Hedge Ratio}{$S_1$, $S_2$}
\State Calculate spread $\gets$ $S_1$$-$hedge$\_$ratio $\times$ $S_2$
\State fast$\_$ema $\gets$ \Call{EMA}{spread, fast}
\State slow$\_$ema $\gets$ \Call{EMA}{spread, slow}
\State apo$\_$spread $\gets$ fast$\_$ema$-$slow$\_$ema
\State position $\gets 0$
\EndProcedure
\State
\Procedure{Next}{buy threshold, sell threshold}
\State \textbf{if}{~apo$\_$spread $<$ buy$\_$threshold} \textbf{then}
\State \hspace{1cm} Execute Buy for $S_1$ and Sell Short for $S_2$
\State \textbf{else if}{apo$\_$spread $>$ sell$\_$threshold} \textbf{then}
\State \hspace{1cm} Execute Sell Short for $S_1$ and Buy for $S_2$
\State \textbf{end if}
\EndProcedure
\end{algorithmic} | "https://arxiv.org/src/2401.14761" | "2401.14761.tar.gz" | "2024-01-26" | {
"title": "esg driven pairs algorithm for sustainable trading: analysis from the indian market",
"id": "2401.14761",
"abstract": "this paper proposes an algorithmic trading framework integrating environmental, social, and governance (esg) ratings with a pairs trading strategy. it addresses the demand for socially responsible investment solutions by developing a unique algorithm blending esg data with methods for identifying co-integrated stocks. this allows selecting profitable pairs adhering to esg principles. further, it incorporates technical indicators for optimal trade execution within this sustainability framework. extensive back-testing provides evidence of the model's effectiveness, consistently generating positive returns exceeding conventional pairs trading strategies, while upholding esg principles. this paves the way for a transformative approach to algorithmic trading, offering insights for investors, policymakers, and academics.",
"categories": "q-fin.tr",
"doi": "",
"created": "2024-01-26",
"updated": "",
"authors": [
"eeshaan dutta",
"sarthak diwan",
"siddhartha p. chakrabarty"
],
"affiliation": [],
"url": "https://arxiv.org/abs/2401.14761"
} | "2024-03-15T05:30:05.430403" | {
"ToxicityFilter": {
"text_to_toxicity_attributes": {
"bib.bib": {
"toxicity_score": 0.012063419,
"severe_toxicity_score": 0.0014019012,
"identity_attack_score": 0.0023401144,
"insult_score": 0.008519882,
"profanity_score": 0.016172111,
"threat_score": 0.006822242,
"sexually_explicit_score": 0.0115595255,
"flirtation_score": 0.2017521
},
"ED_SD_SPC_260124.tex": {
"toxicity_score": 0.012126249,
"severe_toxicity_score": 0.0011730194,
"identity_attack_score": 0.0038292783,
"insult_score": 0.0076838774,
"profanity_score": 0.015488927,
"threat_score": 0.007598988,
"sexually_explicit_score": 0.01250316,
"flirtation_score": 0.21894184
},
"ED_SD_SPC_260124.bbl": {
"toxicity_score": 0.011874928,
"severe_toxicity_score": 0.0011348724,
"identity_attack_score": 0.003866276,
"insult_score": 0.0075508766,
"profanity_score": 0.014532468,
"threat_score": 0.007521313,
"sexually_explicit_score": 0.010969753,
"flirtation_score": 0.27629572
}
},
"reason": null
}
} | {
"num_done": {
"figure": 0,
"algorithm": 3,
"plot": 0
}
} | {
"NonTrivialRenderingFilter": {
"white_pixels_ratio": 87.3581322268664,
"hash": "078f8f8f9f9f813f",
"most_frequent_color_ratio": 87.3581322268664
}
} | [] | "algorithm" | "d4f074dd-00b8-4ebd-9eff-3126db854c98" | 1105 | medium |
|
\begin{algorithm}
GPB(N) Algorithm
\end{algorithm}
| \begin{algorithm}
GPB(N) Algorithm
\end{algorithm} | "https://arxiv.org/src/2402.08051" | "2402.08051.tar.gz" | "2024-02-12" | {
"title": "on bayesian filtering for markov regime switching models",
"id": "2402.08051",
"abstract": "this paper presents a framework for empirical analysis of dynamic macroeconomic models using bayesian filtering, with a specific focus on the state-space formulation of dynamic stochastic general equilibrium (dsge) models with multiple regimes. we outline the theoretical foundations of model estimation, provide the details of two families of powerful multiple-regime filters, imm and gpb, and construct corresponding multiple-regime smoothers. a simulation exercise, based on a prototypical new keynesian dsge model, is used to demonstrate the computational robustness of the proposed filters and smoothers and evaluate their accuracy and speed for a selection of filters from each family. we show that the canonical imm filter is faster and is no less, and often more, accurate than its competitors within imm and gpb families, the latter including the commonly used kim and nelson (1999) filter. using it with the matching smoother improves the precision in recovering unobserved variables by about 25 percent. furthermore, applying it to the u.s. 1947-2023 macroeconomic time series, we successfully identify significant past policy shifts including those related to the post-covid-19 period. our results demonstrate the practical applicability and potential of the proposed routines in macroeconomic analysis.",
"categories": "econ.em",
"doi": "",
"created": "2024-02-12",
"updated": "",
"authors": [
"nigar hashimzade",
"oleg kirsanov",
"tatiana kirsanova",
"junior maih"
],
"affiliation": [],
"url": "https://arxiv.org/abs/2402.08051"
} | "2024-03-15T04:21:14.605813" | {
"ToxicityFilter": {
"text_to_toxicity_attributes": {
"paper_draft_8_arxiv.bbl": {
"toxicity_score": 0.012314741,
"severe_toxicity_score": 0.0012016296,
"identity_attack_score": 0.0041067624,
"insult_score": 0.007797878,
"profanity_score": 0.015181494,
"threat_score": 0.007586042,
"sexually_explicit_score": 0.011264639,
"flirtation_score": 0.20508216
},
"empirics.eps": {
"toxicity_score": 0.0058118035,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0011515582,
"insult_score": 0.006344369,
"profanity_score": 0.012175481,
"threat_score": 0.0060196044,
"sexually_explicit_score": 0.0072836806,
"flirtation_score": 0.49011314
},
"demo.bib": {
"toxicity_score": 0.0068799187,
"severe_toxicity_score": 0.0009441376,
"identity_attack_score": 0.001655654,
"insult_score": 0.0068668723,
"profanity_score": 0.013029462,
"threat_score": 0.0062332097,
"sexually_explicit_score": 0.008669644,
"flirtation_score": 0.25294632
},
"Figure1.eps": {
"toxicity_score": 0.0058118035,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0011515582,
"insult_score": 0.006344369,
"profanity_score": 0.012175481,
"threat_score": 0.0060196044,
"sexually_explicit_score": 0.0072836806,
"flirtation_score": 0.49011314
},
"paper_draft_8_arxiv.tex": {
"toxicity_score": 0.011686437,
"severe_toxicity_score": 0.0011062622,
"identity_attack_score": 0.0032928092,
"insult_score": 0.007360875,
"profanity_score": 0.015181494,
"threat_score": 0.007974415,
"sexually_explicit_score": 0.0136827035,
"flirtation_score": 0.6102261
},
"dataupdate.eps": {
"toxicity_score": 0.0058118035,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0011515582,
"insult_score": 0.006344369,
"profanity_score": 0.012175481,
"threat_score": 0.0060196044,
"sexually_explicit_score": 0.0072836806,
"flirtation_score": 0.49011314
},
"Missp1.eps": {
"toxicity_score": 0.0058118035,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0011515582,
"insult_score": 0.006344369,
"profanity_score": 0.012175481,
"threat_score": 0.0060196044,
"sexually_explicit_score": 0.0072836806,
"flirtation_score": 0.49011314
}
},
"reason": null
}
} | {
"num_done": {
"figure": 0,
"algorithm": 3,
"plot": 0
}
} | {
"NonTrivialRenderingFilter": {
"white_pixels_ratio": 88.52194925493355,
"hash": "00ff7f3f3f3fff00",
"most_frequent_color_ratio": 88.52194925493355
}
} | [] | "algorithm" | "75bee723-8648-4b9d-82cd-341a3bad5259" | 50 | easy |
|
\begin{algorithmic}[1]
\State Initialize an empty list $l$
\For{\textbf{each} $i$ \textbf{in} $producers$}
\For{$t$ \textbf{in} $[500, 900)$}
\If{$\forall x \in \{p_{it},p_{i(t+1)},\dots,p_{i1000}\}(x < \epsilon)$}
\State $l$\textbf{.push}(True)
\State \textbf{break}
\EndIf
\EndFor
\State $l$\textbf{.push}(False)
\EndFor
\If{$\forall \text{y} \in l$\text{(y==True)}}
\State \textbf{return} $"Equilibrium"$
\Else
\State \textbf{return} $"Disequilibrium"$
\EndIf
\end{algorithmic}
| \begin{algorithmic}
[1]
\State Initialize an empty list $l$
\For{\textbf{each} $i$ \textbf{in} $producers$}
\For{$t$ \textbf{in} $[500, 900)$}
\If{$\forall x \in \{p_{it},p_{i(t+1)},\dots,p_{i1000}\}(x < \epsilon)$}
\State $l$\textbf{.push}(True)
\State \textbf{break}
\EndIf
\EndFor
\State $l$\textbf{.push}(False)
\EndFor
\If{$\forall \text{y} \in l$\text{(y==True)}}
\State \textbf{return} $"Equilibrium"$
\Else
\State \textbf{return} $"Disequilibrium"$
\EndIf
\end{algorithmic} | "https://arxiv.org/src/2401.07070" | "2401.07070.tar.gz" | "2024-01-13" | {
"title": "a dynamic agent based model of the real economy with monopolistic competition, perfect product differentiation, heterogeneous agents, increasing returns to scale and trade in disequilibrium",
"id": "2401.07070",
"abstract": "we have used agent-based modeling as our numerical method to artificially simulate a dynamic real economy where agents are rational maximizers of an objective function of cobb-douglas type. the economy is characterised by heterogeneous agents, acting out of local or imperfect information, monopolistic competition, perfect product differentiation, allowance for increasing returns to scale technology and trade in disequilibrium. an algorithm for economic activity in each period is devised and a general purpose open source agent-based model is developed which allows for counterfactual inquiries, testing out treatments, analysing causality of various economic processes, outcomes and studying emergent properties. 10,000 simulations, with 10 firms and 80 consumers are run with varying parameters and the results show that from only a few initial conditions the economy reaches equilibrium while in most of the other cases it remains in perpetual disequilibrium. it also shows that from a few initial conditions the economy reaches a disaster where all the consumer wealth falls to zero or only a single producer remains. furthermore, from some initial conditions, an ideal economy with high wage rate, high consumer utility and no unemployment is also reached. it was also observed that starting from an equal endowment of wealth in consumers and in producers, inequality emerged in the economy. in majority of the cases most of the firms(6-7) shut down because they were not profitable enough and only a few firms remained. our results highlight that all these varying outcomes are possible for a decentralized market economy with rational optimizing agents.",
"categories": "econ.th cs.ma",
"doi": "",
"created": "2024-01-13",
"updated": "",
"authors": [
"subhamon supantha",
"naresh kumar sharma"
],
"affiliation": [],
"url": "https://arxiv.org/abs/2401.07070"
} | "2024-03-15T06:13:08.276479" | {
"ToxicityFilter": {
"text_to_toxicity_attributes": {
"sn-article.tex": {
"toxicity_score": 0.0046494426,
"severe_toxicity_score": 0.00053167343,
"identity_attack_score": 0.001415168,
"insult_score": 0.006011867,
"profanity_score": 0.010569996,
"threat_score": 0.0062396824,
"sexually_explicit_score": 0.006605443,
"flirtation_score": 0.2874154
},
"empty.eps": {
"toxicity_score": 0.007885204,
"severe_toxicity_score": 0.0008249283,
"identity_attack_score": 0.0019146391,
"insult_score": 0.0067908717,
"profanity_score": 0.013268576,
"threat_score": 0.006699257,
"sexually_explicit_score": 0.008492713,
"flirtation_score": 0.45258012
},
"sn-vancouver.bst": {
"toxicity_score": 0.010995304,
"severe_toxicity_score": 0.0008535385,
"identity_attack_score": 0.0033298072,
"insult_score": 0.007797878,
"profanity_score": 0.013268576,
"threat_score": 0.0067316215,
"sexually_explicit_score": 0.008256803,
"flirtation_score": 0.4476301
},
"sn-jnl.cls": {
"toxicity_score": 0.011812098,
"severe_toxicity_score": 0.0011396408,
"identity_attack_score": 0.003366805,
"insult_score": 0.007721877,
"profanity_score": 0.01402008,
"threat_score": 0.007145886,
"sexually_explicit_score": 0.010379982,
"flirtation_score": 0.512107
},
"fig.eps": {
"toxicity_score": 0.0058118035,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0011515582,
"insult_score": 0.006344369,
"profanity_score": 0.012175481,
"threat_score": 0.0060196044,
"sexually_explicit_score": 0.0072836806,
"flirtation_score": 0.49011314
},
"sn-basic.bst": {
"toxicity_score": 0.018974753,
"severe_toxicity_score": 0.0014209747,
"identity_attack_score": 0.0037367835,
"insult_score": 0.010248893,
"profanity_score": 0.018597418,
"threat_score": 0.0071717775,
"sexually_explicit_score": 0.013977589,
"flirtation_score": 0.29158676
},
"sn-bibliography.bib": {
"toxicity_score": 0.009424546,
"severe_toxicity_score": 0.0010919571,
"identity_attack_score": 0.0017758971,
"insult_score": 0.0074368757,
"profanity_score": 0.013336895,
"threat_score": 0.006440342,
"sexually_explicit_score": 0.009554301,
"flirtation_score": 0.20111376
},
"sn-article.bbl": {
"toxicity_score": 0.007351146,
"severe_toxicity_score": 0.000834465,
"identity_attack_score": 0.0024603575,
"insult_score": 0.00654387,
"profanity_score": 0.012585391,
"threat_score": 0.006647474,
"sexually_explicit_score": 0.009200439,
"flirtation_score": 0.5493274
},
"sn-mathphys.bst": {
"toxicity_score": 0.015142105,
"severe_toxicity_score": 0.0013542175,
"identity_attack_score": 0.004236255,
"insult_score": 0.008690883,
"profanity_score": 0.017572641,
"threat_score": 0.007586042,
"sexually_explicit_score": 0.013977589,
"flirtation_score": 0.32881752
},
"sn-chicago.bst": {
"toxicity_score": 0.05205809,
"severe_toxicity_score": 0.0031089783,
"identity_attack_score": 0.00449524,
"insult_score": 0.017872108,
"profanity_score": 0.029050145,
"threat_score": 0.007197669,
"sexually_explicit_score": 0.015334064,
"flirtation_score": 0.22683682
},
"sn-nature.bst": {
"toxicity_score": 0.014827953,
"severe_toxicity_score": 0.0012302399,
"identity_attack_score": 0.0034223017,
"insult_score": 0.008880884,
"profanity_score": 0.015932998,
"threat_score": 0.006861079,
"sexually_explicit_score": 0.010438959,
"flirtation_score": 0.39879754
},
"sn-apacite.bst": {
"toxicity_score": 0.020842785,
"severe_toxicity_score": 0.0014591217,
"identity_attack_score": 0.0035332954,
"insult_score": 0.0105148945,
"profanity_score": 0.019143965,
"threat_score": 0.0075083673,
"sexually_explicit_score": 0.015216109,
"flirtation_score": 0.39166427
},
"sn-aps.bst": {
"toxicity_score": 0.025556687,
"severe_toxicity_score": 0.0018978119,
"identity_attack_score": 0.004994711,
"insult_score": 0.0114649,
"profanity_score": 0.021945024,
"threat_score": 0.00789674,
"sexually_explicit_score": 0.020052237,
"flirtation_score": 0.32421535
}
},
"reason": null
}
} | {
"num_done": {
"figure": 0,
"algorithm": 3
}
} | {
"NonTrivialRenderingFilter": {
"white_pixels_ratio": 92.80746395250212,
"hash": "078ecf9f9f0f0f2f",
"most_frequent_color_ratio": 92.80746395250212
}
} | [] | "algorithm" | "596d1a2a-5955-45c6-abc2-8a6ffce88a00" | 481 | easy |
|
\begin{algorithm}[!ht]
\caption{Discrete empirical interpolation method (DEIM)}\label{alg:DEIM}
\begin{algorithmic}[1]
\State \textbf{Input:} matrix $M \in \mathbb{R}^{n\times m}$ with orthonormal columns
\State \textbf{Output:} index set $I$ if cardinality $m$
\State $I = \{\mathsf{argmax}\ |M(:,1)|\}$
\For $k = 2,\dots,m$
\State $c = M(I,1:k-1)^{-1} M(I,k)$
\State $r = M(:,k) - M(:,1:k-1)c$
\State $I = I \cup \{\mathsf{argmax}\ |r|\}$
\EndFor
\end{algorithmic}
\end{algorithm}
| \begin{algorithm}
[!ht]
\caption{Discrete empirical interpolation method (DEIM)}\begin{algorithmic}
[1]
\State \textbf{Input:} matrix $M \in \mathbb{R}^{n\times m}$ with orthonormal columns
\State \textbf{Output:} index set $I$ if cardinality $m$
\State $I = \{\mathsf{argmax}\ |M(:,1)|\}$
\For $k = 2,\dots,m$
\State $c = M(I,1:k-1)^{-1} M(I,k)$
\State $r = M(:,k) - M(:,1:k-1)c$
\State $I = I \cup \{\mathsf{argmax}\ |r|\}$
\EndFor
\end{algorithmic}
\end{algorithm} | "https://arxiv.org/src/2211.11338" | "2211.11338.tar.gz" | "2024-02-25" | {
"title": "approximation in the extended functional tensor train format",
"id": "2211.11338",
"abstract": "this work proposes the extended functional tensor train (eftt) format for compressing and working with multivariate functions on tensor product domains. our compression algorithm combines tensorized chebyshev interpolation with a low-rank approximation algorithm that is entirely based on function evaluations. compared to existing methods based on the functional tensor train format, the adaptivity of our approach often results in reducing the required storage, sometimes considerably, while achieving the same accuracy. in particular, we reduce the number of function evaluations required to achieve a prescribed accuracy by up to over 96% compared to the algorithm from [gorodetsky, karaman and marzouk, comput. methods appl. mech. eng., 347 (2019)].",
"categories": "math.na cs.na",
"doi": "",
"created": "2022-11-21",
"updated": "2024-02-25",
"authors": [
"christoph str\u00f6ssner",
"bonan sun",
"daniel kressner"
],
"affiliation": [],
"url": "https://arxiv.org/abs/2211.11338"
} | "2024-03-15T03:21:44.181934" | {
"ToxicityFilter": {
"text_to_toxicity_attributes": {
"Figures/RankImpactError.eps": {
"toxicity_score": 0.0058118035,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0011515582,
"insult_score": 0.006344369,
"profanity_score": 0.012175481,
"threat_score": 0.0060196044,
"sexually_explicit_score": 0.0072836806,
"flirtation_score": 0.49011314
},
"Figures/SinIntPlot1.eps": {
"toxicity_score": 0.0058118035,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0011515582,
"insult_score": 0.006344369,
"profanity_score": 0.012175481,
"threat_score": 0.0060196044,
"sexually_explicit_score": 0.0072836806,
"flirtation_score": 0.49011314
},
"3Algorithm.tex": {
"toxicity_score": 0.008419261,
"severe_toxicity_score": 0.0007009506,
"identity_attack_score": 0.002552852,
"insult_score": 0.006828872,
"profanity_score": 0.012380436,
"threat_score": 0.006809296,
"sexually_explicit_score": 0.009259416,
"flirtation_score": 0.28179473
},
"4NumericalComparison.tex": {
"toxicity_score": 0.009738698,
"severe_toxicity_score": 0.0008249283,
"identity_attack_score": 0.0029228306,
"insult_score": 0.006961873,
"profanity_score": 0.012892825,
"threat_score": 0.0070034824,
"sexually_explicit_score": 0.010615891,
"flirtation_score": 0.2632299
},
"1Introduction.tex": {
"toxicity_score": 0.006942749,
"severe_toxicity_score": 0.0007390976,
"identity_attack_score": 0.0022753682,
"insult_score": 0.0064488696,
"profanity_score": 0.012687869,
"threat_score": 0.0066798385,
"sexually_explicit_score": 0.009554301,
"flirtation_score": 0.2300378
},
"Figures/Figure2.eps": {
"toxicity_score": 0.0058118035,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0011515582,
"insult_score": 0.006344369,
"profanity_score": 0.012175481,
"threat_score": 0.0060196044,
"sexually_explicit_score": 0.0072836806,
"flirtation_score": 0.49011314
},
"2Setting.tex": {
"toxicity_score": 0.011120965,
"severe_toxicity_score": 0.00074863434,
"identity_attack_score": 0.0027933381,
"insult_score": 0.0074178753,
"profanity_score": 0.012961143,
"threat_score": 0.006848133,
"sexually_explicit_score": 0.00896453,
"flirtation_score": 0.3054094
},
"0BibtexCollection.bib": {
"toxicity_score": 0.011120965,
"severe_toxicity_score": 0.0012302399,
"identity_attack_score": 0.003348306,
"insult_score": 0.007664877,
"profanity_score": 0.015932998,
"threat_score": 0.007365964,
"sexually_explicit_score": 0.014685315,
"flirtation_score": 0.41820723
},
"Figures/SinIntPlot2.eps": {
"toxicity_score": 0.0058118035,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0011515582,
"insult_score": 0.006344369,
"profanity_score": 0.012175481,
"threat_score": 0.0060196044,
"sexually_explicit_score": 0.0072836806,
"flirtation_score": 0.49011314
},
"main.bbl": {
"toxicity_score": 0.011874928,
"severe_toxicity_score": 0.0011348724,
"identity_attack_score": 0.003866276,
"insult_score": 0.0075508766,
"profanity_score": 0.014532468,
"threat_score": 0.007521313,
"sexually_explicit_score": 0.010969753,
"flirtation_score": 0.27629572
},
"0Prae.tex": {
"toxicity_score": 0.010304171,
"severe_toxicity_score": 0.0010681152,
"identity_attack_score": 0.0027563404,
"insult_score": 0.007303875,
"profanity_score": 0.015249812,
"threat_score": 0.0071070488,
"sexually_explicit_score": 0.0129749775,
"flirtation_score": 0.38520452
},
"Figures/Network_svg-tex.pdf_tex": {
"toxicity_score": 0.010492661,
"severe_toxicity_score": 0.0010585785,
"identity_attack_score": 0.0032743104,
"insult_score": 0.007531876,
"profanity_score": 0.014156717,
"threat_score": 0.007417747,
"sexually_explicit_score": 0.010792822,
"flirtation_score": 0.39689377
},
"Figures/Network.svg": {
"toxicity_score": 0.011686437,
"severe_toxicity_score": 0.0010442734,
"identity_attack_score": 0.004402745,
"insult_score": 0.007778878,
"profanity_score": 0.015318131,
"threat_score": 0.007417747,
"sexually_explicit_score": 0.011736456,
"flirtation_score": 0.3600297
},
"6Apendix.tex": {
"toxicity_score": 0.01646154,
"severe_toxicity_score": 0.0016212463,
"identity_attack_score": 0.0034408006,
"insult_score": 0.008424882,
"profanity_score": 0.017777596,
"threat_score": 0.00866054,
"sexually_explicit_score": 0.016395653,
"flirtation_score": 0.19581212
},
"main.tex": {
"toxicity_score": 0.0109324735,
"severe_toxicity_score": 0.0010871887,
"identity_attack_score": 0.0034038029,
"insult_score": 0.0072658747,
"profanity_score": 0.014225035,
"threat_score": 0.0076766624,
"sexually_explicit_score": 0.012385205,
"flirtation_score": 0.14575823
},
"Figures/RankImpactEvals.eps": {
"toxicity_score": 0.0058118035,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0011515582,
"insult_score": 0.006344369,
"profanity_score": 0.012175481,
"threat_score": 0.0060196044,
"sexually_explicit_score": 0.0072836806,
"flirtation_score": 0.49011314
},
"5Conclusion.tex": {
"toxicity_score": 0.009613037,
"severe_toxicity_score": 0.0008869171,
"identity_attack_score": 0.0028673338,
"insult_score": 0.006990373,
"profanity_score": 0.013063621,
"threat_score": 0.0072106146,
"sexually_explicit_score": 0.009672256,
"flirtation_score": 0.23823524
}
},
"reason": null
}
} | {
"num_done": {
"table": 0,
"figure": 0,
"algorithm": 2,
"plot": 0
}
} | {
"NonTrivialRenderingFilter": {
"white_pixels_ratio": 91.75809517457564,
"hash": "01030f3f3f8f9f3f",
"most_frequent_color_ratio": 91.75809517457564
}
} | [] | "algorithm" | "080b212f-f820-4ed0-803b-0cd7ba5e82d4" | 467 | easy |
|
\begin{algorithm}
\caption{Multi-Period Transition Framework}\label{alg:MPTF}
\begin{algorithmic}[H]
\Require $P_0, \mathcal{T}, Y_{-L:0}, \mathbf{X}_{-L:0}, V_0, \mathbf{T}, C_0$, OPT, Forecaster, MarketObserver
\Ensure $Y_0^T\mathcal{T} + C_0 \leq V_0$
\State $t \gets 0$
\State $P_t \gets P_0$
\State $C_t \gets C_0$
\State $Y \gets Y_{-L:t}$
\While{$t \leq \mathbf{T}$}
\State $V_t \gets Y_t^TP_t + C_t$ \Comment{Calculate portfolio value at current timestep}
\State $\hat{Y}_{t+1:\mathbf{T}}\gets \text{Forecaster}(Y_{-L:t}, \mathbf{X}_{-L:t})$ \Comment{Predict unknown time steps with known information}
\State $Z_{t:\mathbf{T}}, W_{t:\mathbf{T}} \gets \text{OPT}([Y_t\ \hat{Y}_{t+1:\mathbf{T}}], P_t, C_t, \mathcal{T})$ \Comment{Run Optimization Policy}
\State $P_{t+1} \gets P_t + Z_t$ \Comment{Execute trades at current timestep}
\State $C_{t+1} \gets C_t - Y_t\cdot Z_t - F\Vec{1} \cdot W_t$ \Comment{Calculate cash}
\State $Y_{t+1} \gets \text{MarketObserver}()$ \Comment{Observe the market for new price information}
\State $t \gets t + 1$
\EndWhile
\Ensure $P_\mathbf{T} \geq \mathcal{T}$
\end{algorithmic}
\end{algorithm}
| \begin{algorithm}
\caption{Multi-Period Transition Framework}\begin{algorithmic}
[H]
\Require $P_0, \mathcal{T}, Y_{-L:0}, \mathbf{X}_{-L:0}, V_0, \mathbf{T}, C_0$, OPT, Forecaster, MarketObserver
\Ensure $Y_0^T\mathcal{T} + C_0 \leq V_0$
\State $t \gets 0$
\State $P_t \gets P_0$
\State $C_t \gets C_0$
\State $Y \gets Y_{-L:t}$
\While{$t \leq \mathbf{T}$}
\State $V_t \gets Y_t^TP_t + C_t$ \Comment{Calculate portfolio value at current timestep}
\State $\hat{Y}_{t+1:\mathbf{T}}\gets \text{Forecaster}(Y_{-L:t}, \mathbf{X}_{-L:t})$ \Comment{Predict unknown time steps with known information}
\State $Z_{t:\mathbf{T}}, W_{t:\mathbf{T}} \gets \text{OPT}([Y_t\ \hat{Y}_{t+1:\mathbf{T}}], P_t, C_t, \mathcal{T})$ \Comment{Run Optimization Policy}
\State $P_{t+1} \gets P_t + Z_t$ \Comment{Execute trades at current timestep}
\State $C_{t+1} \gets C_t - Y_t\cdot Z_t - F\Vec{1} \cdot W_t$ \Comment{Calculate cash}
\State $Y_{t+1} \gets \text{MarketObserver}()$ \Comment{Observe the market for new price information}
\State $t \gets t + 1$
\EndWhile
\Ensure $P_\mathbf{T} \geq \mathcal{T}$
\end{algorithmic}
\end{algorithm} | "https://arxiv.org/src/2401.13126" | "2401.13126.tar.gz" | "2024-01-24" | {
"title": "optimizing transition strategies for small to medium sized portfolios",
"id": "2401.13126",
"abstract": "this work discusses the benefits of constrained portfolio turnover strategies for small to medium-sized portfolios. we propose a dynamic multi-period model that aims to minimize transaction costs and maximize terminal wealth levels whilst adhering to strict portfolio turnover constraints. our results demonstrate that using our framework in combination with a reasonable forecast, can lead to higher portfolio values and lower transaction costs on average when compared to a naive, single-period model. such results were maintained given different problem cases, such as, trading horizon, assets under management, wealth levels, etc. in addition, the proposed model lends itself to a reformulation that makes use of the column generation algorithm which can be strategically leveraged to reduce complexity and solving times.",
"categories": "q-fin.cp",
"doi": "",
"created": "2024-01-23",
"updated": "2024-01-24",
"authors": [
"nakul upadhya",
"alexandre granzer-guay"
],
"affiliation": [],
"url": "https://arxiv.org/abs/2401.13126"
} | "2024-03-15T05:38:12.261498" | {
"ToxicityFilter": {
"text_to_toxicity_attributes": {
"README.md": {
"toxicity_score": 0.007382561,
"severe_toxicity_score": 0.00096321106,
"identity_attack_score": 0.001933138,
"insult_score": 0.0070853736,
"profanity_score": 0.013371054,
"threat_score": 0.0066733654,
"sexually_explicit_score": 0.010026119,
"flirtation_score": 0.2374018
},
"references.bib": {
"toxicity_score": 0.009110395,
"severe_toxicity_score": 0.0012397766,
"identity_attack_score": 0.0017019014,
"insult_score": 0.0073988754,
"profanity_score": 0.0147374235,
"threat_score": 0.006550381,
"sexually_explicit_score": 0.011677479,
"flirtation_score": 0.279325
},
"article.bbl": {
"toxicity_score": 0.011812098,
"severe_toxicity_score": 0.0011110306,
"identity_attack_score": 0.003921773,
"insult_score": 0.0075128763,
"profanity_score": 0.014498309,
"threat_score": 0.0074824756,
"sexually_explicit_score": 0.01102873,
"flirtation_score": 0.20950109
},
"arxiv.sty": {
"toxicity_score": 0.006942749,
"severe_toxicity_score": 0.0016117096,
"identity_attack_score": 0.0010498142,
"insult_score": 0.0062208683,
"profanity_score": 0.018665737,
"threat_score": 0.0057865805,
"sexually_explicit_score": 0.026067909,
"flirtation_score": 0.31151596
},
"License.txt": {
"toxicity_score": 0.013508516,
"severe_toxicity_score": 0.0011301041,
"identity_attack_score": 0.0029968263,
"insult_score": 0.008823884,
"profanity_score": 0.014259194,
"threat_score": 0.00713294,
"sexually_explicit_score": 0.009554301,
"flirtation_score": 0.17687683
},
"article.tex": {
"toxicity_score": 0.010304171,
"severe_toxicity_score": 0.0010061264,
"identity_attack_score": 0.0032558115,
"insult_score": 0.007189874,
"profanity_score": 0.014259194,
"threat_score": 0.0072882893,
"sexually_explicit_score": 0.0108517995,
"flirtation_score": 0.18085068
}
},
"reason": null
}
} | {
"num_done": {
"figure": 0,
"algorithm": 2,
"plot": 0
}
} | {
"NonTrivialRenderingFilter": {
"white_pixels_ratio": 92.81160905916647,
"hash": "1d7f3f0000803f3f",
"most_frequent_color_ratio": 92.81160905916647
}
} | [] | "algorithm" | "9d6c0f2d-70af-4e25-9cee-9bec2c661226" | 1119 | medium |
|
\begin{algorithm}
\caption{getNextStage(candidates, k)}\label{alg:te2rules_stagek}
\begin{algorithmic}
\State $newCandidates \gets []$
\\
\For{$r_1 \gets candidates$}
\For{$r_2 \gets candidates$}
\State $nodes_1 = r_1.sourceNodes$
\State $nodes_2 = r_2.sourceNodes$
\If{$|nodes_1 \cap nodes_2| = k - 2$}
\State $r \gets r_1 \& r_2$
\State $r.sourceNodes \gets n_1 \cup n_2$
\If{$|r.support| > \epsilon$}
\State $candidates.append(r)$
\EndIf
\EndIf
\EndFor
\EndFor
\\
\Return $newCandidates$
\end{algorithmic}
\end{algorithm}
| \begin{algorithm}
\caption{getNextStage(candidates, k)}\begin{algorithmic}
\State $newCandidates \gets []$
\\
\For{$r_1 \gets candidates$}
\For{$r_2 \gets candidates$}
\State $nodes_1 = r_1.sourceNodes$
\State $nodes_2 = r_2.sourceNodes$
\If{$|nodes_1 \cap nodes_2| = k - 2$}
\State $r \gets r_1 \& r_2$
\State $r.sourceNodes \gets n_1 \cup n_2$
\If{$|r.support| > \epsilon$}
\State $candidates.append(r)$
\EndIf
\EndIf
\EndFor
\EndFor
\\
\Return $newCandidates$
\end{algorithmic}
\end{algorithm} | "https://arxiv.org/src/2206.14359" | "2206.14359.tar.gz" | "2024-01-23" | {
"title": "te2rules: explaining tree ensembles using rules",
"id": "2206.14359",
"abstract": "tree ensemble (te) models, such as gradient boosted trees, often achieve optimal performance on tabular datasets, yet their lack of transparency poses challenges for comprehending their decision logic. this paper introduces te2rules (tree ensemble to rules), a novel approach for explaining binary classification tree ensemble models through a list of rules, particularly focusing on explaining the minority class. many state-of-the-art explainers struggle with minority class explanations, making te2rules valuable in such cases. the rules generated by te2rules closely approximate the original model, ensuring high fidelity, providing an accurate and interpretable means to understand decision-making. experimental results demonstrate that te2rules scales effectively to tree ensembles with hundreds of trees, achieving higher fidelity within runtimes comparable to baselines. te2rules allows for a trade-off between runtime and fidelity, enhancing its practical applicability. the implementation is available here: https://github.com/linkedin/te2rules.",
"categories": "cs.lg cs.ai",
"doi": "",
"created": "2022-06-28",
"updated": "2024-01-23",
"authors": [
"g roshan lal",
"xiaotong chen",
"varun mithal"
],
"affiliation": [],
"url": "https://arxiv.org/abs/2206.14359"
} | "2024-03-15T09:04:28.850184" | {
"ToxicityFilter": {
"text_to_toxicity_attributes": {
"checklist.tex": {
"toxicity_score": 0.007288316,
"severe_toxicity_score": 0.00079631805,
"identity_attack_score": 0.0020811295,
"insult_score": 0.00654387,
"profanity_score": 0.012995303,
"threat_score": 0.006712203,
"sexually_explicit_score": 0.009849187,
"flirtation_score": 0.18074825
},
"main.tex": {
"toxicity_score": 0.012063419,
"severe_toxicity_score": 0.0011825562,
"identity_attack_score": 0.00362579,
"insult_score": 0.0075888764,
"profanity_score": 0.015591404,
"threat_score": 0.0076507707,
"sexually_explicit_score": 0.014449406,
"flirtation_score": 0.4688245
},
"method.tex": {
"toxicity_score": 0.012314741,
"severe_toxicity_score": 0.0014591217,
"identity_attack_score": 0.00414376,
"insult_score": 0.0077408776,
"profanity_score": 0.015932998,
"threat_score": 0.008065036,
"sexually_explicit_score": 0.014685315,
"flirtation_score": 0.17910686
},
"introduction.tex": {
"toxicity_score": 0.006942749,
"severe_toxicity_score": 0.0007390976,
"identity_attack_score": 0.0022753682,
"insult_score": 0.0064488696,
"profanity_score": 0.012687869,
"threat_score": 0.0066798385,
"sexually_explicit_score": 0.009554301,
"flirtation_score": 0.2300378
},
"main.bbl": {
"toxicity_score": 0.01218908,
"severe_toxicity_score": 0.0011348724,
"identity_attack_score": 0.003921773,
"insult_score": 0.007607877,
"profanity_score": 0.014634945,
"threat_score": 0.0074824756,
"sexually_explicit_score": 0.011323617,
"flirtation_score": 0.2033491
},
"related.tex": {
"toxicity_score": 0.0074453913,
"severe_toxicity_score": 0.0007200241,
"identity_attack_score": 0.0024973555,
"insult_score": 0.0065818704,
"profanity_score": 0.01265371,
"threat_score": 0.006699257,
"sexually_explicit_score": 0.009023507,
"flirtation_score": 0.2352925
},
"results.tex": {
"toxicity_score": 0.021432023,
"severe_toxicity_score": 0.0019454956,
"identity_attack_score": 0.005105704,
"insult_score": 0.0096028885,
"profanity_score": 0.018529098,
"threat_score": 0.008686432,
"sexually_explicit_score": 0.017457243,
"flirtation_score": 0.19775106
},
"problem.tex": {
"toxicity_score": 0.009927189,
"severe_toxicity_score": 0.0008058548,
"identity_attack_score": 0.0028673338,
"insult_score": 0.007132874,
"profanity_score": 0.012961143,
"threat_score": 0.0069905366,
"sexually_explicit_score": 0.007961918,
"flirtation_score": 0.19516823
},
"appendix.tex": {
"toxicity_score": 0.008859074,
"severe_toxicity_score": 0.001077652,
"identity_attack_score": 0.002626848,
"insult_score": 0.0067433715,
"profanity_score": 0.014669105,
"threat_score": 0.0071070488,
"sexually_explicit_score": 0.012680092,
"flirtation_score": 0.21909615
},
"conclusion.tex": {
"toxicity_score": 0.008921904,
"severe_toxicity_score": 0.000705719,
"identity_attack_score": 0.0020811295,
"insult_score": 0.006885872,
"profanity_score": 0.012687869,
"threat_score": 0.0067186756,
"sexually_explicit_score": 0.009023507,
"flirtation_score": 0.26385543
},
"aaai24.bst": {
"toxicity_score": 0.016712861,
"severe_toxicity_score": 0.0015354156,
"identity_attack_score": 0.0039402717,
"insult_score": 0.009165886,
"profanity_score": 0.018324144,
"threat_score": 0.0075083673,
"sexually_explicit_score": 0.015805881,
"flirtation_score": 0.40847883
},
"main.bib": {
"toxicity_score": 0.0070369947,
"severe_toxicity_score": 0.0010967255,
"identity_attack_score": 0.0013504218,
"insult_score": 0.0066388706,
"profanity_score": 0.012961143,
"threat_score": 0.006051969,
"sexually_explicit_score": 0.010379982,
"flirtation_score": 0.21000691
},
"abstract.tex": {
"toxicity_score": 0.012691722,
"severe_toxicity_score": 0.0012874603,
"identity_attack_score": 0.0036812867,
"insult_score": 0.007892879,
"profanity_score": 0.01535229,
"threat_score": 0.007689608,
"sexually_explicit_score": 0.012621114,
"flirtation_score": 0.19561295
},
"aaai24.sty": {
"toxicity_score": 0.004837934,
"severe_toxicity_score": 0.0011110306,
"identity_attack_score": 0.00069833454,
"insult_score": 0.0057743657,
"profanity_score": 0.015079016,
"threat_score": 0.0055859215,
"sexually_explicit_score": 0.018164968,
"flirtation_score": 0.38160232
}
},
"reason": null
}
} | {
"num_done": {
"figure": 0,
"algorithm": 3
}
} | {
"NonTrivialRenderingFilter": {
"white_pixels_ratio": 94.70896211887897,
"hash": "001f0f8f8f8f3f1f",
"most_frequent_color_ratio": 94.70896211887897
}
} | [] | "algorithm" | "4838572e-3197-4b9d-96d2-c4263ddd219d" | 496 | easy |
|
\begin{algorithmic}[1]
\State Simulate $N$ random variables from $\text{Uniform}(0,1)$; Denote $\tilde{U}=(\tilde{U}_{(1)},...,\tilde{U}_{(N)})$ as the vector of $N$ simulated Uniformly distributed random variables
\State Denote $\tilde{Y}^{*}_{ij}=(\tilde{Y}^{*}_{ij,(1)},...,\tilde{Y}^{*}_{ij,(N)})$ as the vector of $N$ simulated variables for cell $(i,j)$ from the ensemble
\For{$n=1,..,N$}
\If{$\tilde{U}_{(n)} \in (\sum_{m=1}^{l-1}w_m,\sum_{m=1}^{l}w_m]$}
\State simulate a random variable from the $l^{th}$ component distribution, denoted as $\tilde{Y}_{ij}^{(l)}$
\State Set $\tilde{Y}^{*}_{ij,(n)}=\tilde{Y}_{ij}^{(l)}$
\EndIf
\EndFor
\State Repeat the above two steps for each cell $(i,j)$
\State Calculate the simulated reserve based on the simulated random variables for each cell $(i,j)$: $\tilde{R}^{*}=(\tilde{R}^{*}_{(1)},\tilde{R}^{*}_{(2)},...,\tilde{R}^{*}_{(N)})=(\sum_{i,j\in D^{out}}\tilde{Y}_{ij,(1)}^{*},\sum_{i,j\in D^{out}}\tilde{Y}_{ij,(2)}^{*},...,\sum_{i,j\in D^{out}}\tilde{Y}_{ij,(N)}^{*})$
\State Calculate the empirical $75^{th}$ quantile of the $N$ simulated reserves for the ensemble: $R^{*}_{75}$
\end{algorithmic}
| \begin{algorithmic}
[1]
\State Simulate $N$ random variables from $\text{Uniform}(0,1)$; Denote $\tilde{U}=(\tilde{U}_{(1)},...,\tilde{U}_{(N)})$ as the vector of $N$ simulated Uniformly distributed random variables
\State Denote $\tilde{Y}^{*}_{ij}=(\tilde{Y}^{*}_{ij,(1)},...,\tilde{Y}^{*}_{ij,(N)})$ as the vector of $N$ simulated variables for cell $(i,j)$ from the ensemble
\For{$n=1,..,N$}
\If{$\tilde{U}_{(n)} \in (\sum_{m=1}^{l-1}w_m,\sum_{m=1}^{l}w_m]$}
\State simulate a random variable from the $l^{th}$ component distribution, denoted as $\tilde{Y}_{ij}^{(l)}$
\State Set $\tilde{Y}^{*}_{ij,(n)}=\tilde{Y}_{ij}^{(l)}$
\EndIf
\EndFor
\State Repeat the above two steps for each cell $(i,j)$
\State Calculate the simulated reserve based on the simulated random variables for each cell $(i,j)$: $\tilde{R}^{*}=(\tilde{R}^{*}_{(1)},\tilde{R}^{*}_{(2)},...,\tilde{R}^{*}_{(N)})=(\sum_{i,j\in D^{out}}\tilde{Y}_{ij,(1)}^{*},\sum_{i,j\in D^{out}}\tilde{Y}_{ij,(2)}^{*},...,\sum_{i,j\in D^{out}}\tilde{Y}_{ij,(N)}^{*})$
\State Calculate the empirical $75^{th}$ quantile of the $N$ simulated reserves for the ensemble: $R^{*}_{75}$
\end{algorithmic} | "https://arxiv.org/src/2206.08541" | "2206.08541.tar.gz" | "2024-02-19" | {
"title": "ensemble distributional forecasting for insurance loss reserving",
"id": "2206.08541",
"abstract": "loss reserving generally focuses on identifying a single model that can generate superior predictive performance. however, different loss reserving models specialise in capturing different aspects of loss data. this is recognised in practice in the sense that results from different models are often considered, and sometimes combined. for instance, actuaries may take a weighted average of the prediction outcomes from various loss reserving models, often based on subjective assessments. in this paper, we propose a systematic framework to objectively combine (i.e. ensemble) multiple _stochastic_ loss reserving models such that the strengths offered by different models can be utilised effectively. our framework contains two main innovations compared to existing literature and practice. firstly, our criteria model combination considers the full distributional properties of the ensemble and not just the central estimate - which is of particular importance in the reserving context. secondly, our framework is that it is tailored for the features inherent to reserving data. these include, for instance, accident, development, calendar, and claim maturity effects. crucially, the relative importance and scarcity of data across accident periods renders the problem distinct from the traditional ensembling techniques in statistical learning. our framework is illustrated with a complex synthetic dataset. in the results, the optimised ensemble outperforms both (i) traditional model selection strategies, and (ii) an equally weighted ensemble. in particular, the improvement occurs not only with central estimates but also relevant quantiles, such as the 75th percentile of reserves (typically of interest to both insurers and regulators).",
"categories": "stat.me q-fin.rm stat.ap",
"doi": "",
"created": "2022-06-17",
"updated": "2024-02-19",
"authors": [
"benjamin avanzi",
"yanfeng li",
"bernard wong",
"alan xian"
],
"affiliation": [],
"url": "https://arxiv.org/abs/2206.08541"
} | "2024-03-15T03:14:29.396980" | {
"ToxicityFilter": {
"text_to_toxicity_attributes": {
"libraries.bib": {
"toxicity_score": 0.015707577,
"severe_toxicity_score": 0.0012588501,
"identity_attack_score": 0.0058826595,
"insult_score": 0.008975885,
"profanity_score": 0.01620627,
"threat_score": 0.0077154995,
"sexually_explicit_score": 0.0129749775,
"flirtation_score": 0.45469284
},
"AvLiWoXi24.tex": {
"toxicity_score": 0.011183795,
"severe_toxicity_score": 0.0011491776,
"identity_attack_score": 0.0038292783,
"insult_score": 0.0075128763,
"profanity_score": 0.015113175,
"threat_score": 0.0075083673,
"sexually_explicit_score": 0.012857023,
"flirtation_score": 0.28364742
},
"AvLiWoXi24.bbl": {
"toxicity_score": 0.012817383,
"severe_toxicity_score": 0.0011920929,
"identity_attack_score": 0.003903274,
"insult_score": 0.007721877,
"profanity_score": 0.015113175,
"threat_score": 0.007521313,
"sexually_explicit_score": 0.012326228,
"flirtation_score": 0.21668419
},
"elsarticle.cls": {
"toxicity_score": 0.011560776,
"severe_toxicity_score": 0.0010490417,
"identity_attack_score": 0.0031263188,
"insult_score": 0.007493876,
"profanity_score": 0.0138151245,
"threat_score": 0.007068211,
"sexually_explicit_score": 0.009613278,
"flirtation_score": 0.44272235
}
},
"reason": null
}
} | {
"num_done": {
"table": 3,
"figure": 0,
"algorithm": 3,
"plot": 0
}
} | {
"NonTrivialRenderingFilter": {
"white_pixels_ratio": 92.19083617058111,
"hash": "03131f037f1f0303",
"most_frequent_color_ratio": 92.19083617058111
}
} | [] | "algorithm" | "1d289ead-1c69-4045-8011-bd2568d3d304" | 1151 | medium |
|
\begin{algorithmic}
\vspace{1mm}
\State{// \texttt{Iterate over all the haloes in catalogue}}
\For{ halo in catalogue }
\vspace{3mm}
\State{// \texttt{Compute probability of central}}
\State{$p_\text{cen} \leftarrow \text{model.}N_\text{cen}( $ halo.mass $ )$ }
\vspace{3mm}
\State{// \texttt{Define a binomial random variable}}
\State{select $\leftarrow$ random.Binomial(1, $p_\text{cen}$)}
\If{ select }
\State{halo $\leftarrow$ central}
\EndIf
\vspace{3mm}
\State{// \texttt{Compute average number of satellites}}
\State{$\overline{N}_\text{sat} \leftarrow \text{model.}N_\text{sat}( $ halo.mass $ )$}
\vspace{3mm}
\State{// \texttt{Define a Poisson random variable}}
\State{$N_\text{sat} = $ random.Poisson( $\overline{N}_\text{sat}$ )}
\State{halo $\leftarrow$ select randomly $N_\text{sat}$ objects among satellites}
\EndFor
\vspace{3mm}
\end{algorithmic}
| \begin{algorithmic}
\vspace{1mm}
\State{// \texttt{Iterate over all the haloes in catalogue}}
\For{ halo in catalogue }
\vspace{3mm}
\State{// \texttt{Compute probability of central}}
\State{$p_\text{cen} \leftarrow \text{model.}N_\text{cen}( $ halo.mass $ )$ }
\vspace{3mm}
\State{// \texttt{Define a binomial random variable}}
\State{select $\leftarrow$ random.Binomial(1, $p_\text{cen}$)}
\If{ select }
\State{halo $\leftarrow$ central}
\EndIf
\vspace{3mm}
\State{// \texttt{Compute average number of satellites}}
\State{$\overline{N}_\text{sat} \leftarrow \text{model.}N_\text{sat}( $ halo.mass $ )$}
\vspace{3mm}
\State{// \texttt{Define a Poisson random variable}}
\State{$N_\text{sat} = $ random.Poisson( $\overline{N}_\text{sat}$ )}
\State{halo $\leftarrow$ select randomly $N_\text{sat}$ objects among satellites}
\EndFor
\vspace{3mm}
\end{algorithmic} | "https://arxiv.org/src/2002.07179" | "2002.07179.tar.gz" | "2024-02-14" | {
"title": "scampy -- a sub-halo clustering & abundance matching based python interface for painting galaxies on the dark matter halo/sub-halo hierarchy",
"id": "2002.07179",
"abstract": "we present a computational framework for \"painting\" galaxies on top of the dark matter halo/sub-halo hierarchy obtained from n-body simulations. the method we use is based on the sub-halo clustering and abundance matching (scam) scheme which requires observations of the 1- and 2-point statistics of the target (observed) population we want to reproduce. this method is particularly tailored for high redshift studies and thereby relies on the observed high-redshift galaxy luminosity functions and correlation properties. the core functionalities are written in c++ and exploit object oriented programming, with a wide use of polymorphism, to achieve flexibility and high computational efficiency. in order to have an easily accessible interface, all the libraries are wrapped in python and provided with an extensive documentation. we validate our results and provide a simple and quantitative application to reionization, with an investigation of physical quantities related to the galaxy population, ionization fraction and bubble size distribution.",
"categories": "astro-ph.co",
"doi": "10.1093/mnras/staa2201",
"created": "2020-02-17",
"updated": "2024-02-14",
"authors": [
"tommaso ronconi",
"andrea lapi",
"matteo viel",
"alberto sartori"
],
"affiliation": [],
"url": "https://arxiv.org/abs/2002.07179"
} | "2024-03-15T04:34:46.153353" | {
"ToxicityFilter": {
"text_to_toxicity_attributes": {
"tab/python_modules_tab.tex": {
"toxicity_score": 0.013634177,
"severe_toxicity_score": 0.0012397766,
"identity_attack_score": 0.002830336,
"insult_score": 0.007474876,
"profanity_score": 0.016342908,
"threat_score": 0.007857903,
"sexually_explicit_score": 0.018047014,
"flirtation_score": 0.46820065
},
"main.tex": {
"toxicity_score": 0.06500591,
"severe_toxicity_score": 0.0041007996,
"identity_attack_score": 0.016963007,
"insult_score": 0.017485369,
"profanity_score": 0.043916557,
"threat_score": 0.023544617,
"sexually_explicit_score": 0.05246005,
"flirtation_score": 0.28243572
},
"tab/hod_fiducial.tex": {
"toxicity_score": 0.015770407,
"severe_toxicity_score": 0.0015735626,
"identity_attack_score": 0.0034223017,
"insult_score": 0.008443882,
"profanity_score": 0.020100424,
"threat_score": 0.007922632,
"sexually_explicit_score": 0.015334064,
"flirtation_score": 0.19851543
},
"tab/cosmo_params.tex": {
"toxicity_score": 0.015770407,
"severe_toxicity_score": 0.0015735626,
"identity_attack_score": 0.0034223017,
"insult_score": 0.008443882,
"profanity_score": 0.020100424,
"threat_score": 0.007922632,
"sexually_explicit_score": 0.015334064,
"flirtation_score": 0.19851543
},
"readme.txt": {
"toxicity_score": 0.012126249,
"severe_toxicity_score": 0.0012016296,
"identity_attack_score": 0.0030153254,
"insult_score": 0.0075698765,
"profanity_score": 0.01627459,
"threat_score": 0.007741391,
"sexually_explicit_score": 0.013623727,
"flirtation_score": 0.33014694
},
"sec/appendix1.tex": {
"toxicity_score": 0.01005285,
"severe_toxicity_score": 0.0009965897,
"identity_attack_score": 0.0029228306,
"insult_score": 0.007189874,
"profanity_score": 0.015386449,
"threat_score": 0.007262398,
"sexually_explicit_score": 0.010969753,
"flirtation_score": 0.16825074
},
"setup/flowchart_setup.tex": {
"toxicity_score": 0.019728716,
"severe_toxicity_score": 0.0014591217,
"identity_attack_score": 0.0026823445,
"insult_score": 0.009564889,
"profanity_score": 0.014839902,
"threat_score": 0.006815769,
"sexually_explicit_score": 0.00855169,
"flirtation_score": 0.30276403
},
"mnras.bst": {
"toxicity_score": 0.016210219,
"severe_toxicity_score": 0.0014972687,
"identity_attack_score": 0.003311308,
"insult_score": 0.009184887,
"profanity_score": 0.017299367,
"threat_score": 0.00756015,
"sexually_explicit_score": 0.012444182,
"flirtation_score": 0.34847304
},
"sec/section4.tex": {
"toxicity_score": 0.005277746,
"severe_toxicity_score": 0.0006532669,
"identity_attack_score": 0.0014706649,
"insult_score": 0.006030867,
"profanity_score": 0.011663092,
"threat_score": 0.006168481,
"sexually_explicit_score": 0.008315781,
"flirtation_score": 0.17118253
},
"sec/appendix2.tex": {
"toxicity_score": 0.020607091,
"severe_toxicity_score": 0.0013256073,
"identity_attack_score": 0.0026453468,
"insult_score": 0.00983089,
"profanity_score": 0.014190876,
"threat_score": 0.006699257,
"sexually_explicit_score": 0.007902941,
"flirtation_score": 0.30276403
},
"sec/section1.tex": {
"toxicity_score": 0.020607091,
"severe_toxicity_score": 0.0013256073,
"identity_attack_score": 0.0026453468,
"insult_score": 0.00983089,
"profanity_score": 0.014190876,
"threat_score": 0.006699257,
"sexually_explicit_score": 0.007902941,
"flirtation_score": 0.30276403
},
"sec/section2.tex": {
"toxicity_score": 0.016587202,
"severe_toxicity_score": 0.001168251,
"identity_attack_score": 0.0032928092,
"insult_score": 0.008709883,
"profanity_score": 0.015557245,
"threat_score": 0.0077154995,
"sexually_explicit_score": 0.014331453,
"flirtation_score": 0.26444462
},
"flow/algorithm.tex": {
"toxicity_score": 0.02920996,
"severe_toxicity_score": 0.0049209595,
"identity_attack_score": 0.0036997858,
"insult_score": 0.0096028885,
"profanity_score": 0.058946952,
"threat_score": 0.0074565844,
"sexually_explicit_score": 0.06164705,
"flirtation_score": 0.2715643
},
"tab/cosmo_sim.tex": {
"toxicity_score": 0.015770407,
"severe_toxicity_score": 0.0015735626,
"identity_attack_score": 0.0034223017,
"insult_score": 0.008443882,
"profanity_score": 0.020100424,
"threat_score": 0.007922632,
"sexually_explicit_score": 0.015334064,
"flirtation_score": 0.19851543
},
"tab/bench_wraps_tab.tex": {
"toxicity_score": 0.02779579,
"severe_toxicity_score": 0.0023460388,
"identity_attack_score": 0.0037367835,
"insult_score": 0.011844902,
"profanity_score": 0.030890211,
"threat_score": 0.007961469,
"sexually_explicit_score": 0.024062686,
"flirtation_score": 0.29090112
},
"setup/colors_setup.tex": {
"toxicity_score": 0.019728716,
"severe_toxicity_score": 0.0014591217,
"identity_attack_score": 0.0026823445,
"insult_score": 0.009564889,
"profanity_score": 0.014839902,
"threat_score": 0.006815769,
"sexually_explicit_score": 0.00855169,
"flirtation_score": 0.30276403
},
"main.bib": {
"toxicity_score": 0.009047564,
"severe_toxicity_score": 0.0012207031,
"identity_attack_score": 0.0027378413,
"insult_score": 0.008044879,
"profanity_score": 0.014498309,
"threat_score": 0.0066345283,
"sexually_explicit_score": 0.010497936,
"flirtation_score": 0.22983554
},
"sec/section6.tex": {
"toxicity_score": 0.005717558,
"severe_toxicity_score": 0.0006246567,
"identity_attack_score": 0.0017758971,
"insult_score": 0.006068867,
"profanity_score": 0.0113727385,
"threat_score": 0.006382086,
"sexually_explicit_score": 0.0076080547,
"flirtation_score": 0.20100538
},
"mnras.cls": {
"toxicity_score": 0.016838523,
"severe_toxicity_score": 0.0013637543,
"identity_attack_score": 0.004384246,
"insult_score": 0.008880884,
"profanity_score": 0.017709278,
"threat_score": 0.0082074385,
"sexually_explicit_score": 0.01769315,
"flirtation_score": 0.33977222
},
"tab/bubble_size_param.tex": {
"toxicity_score": 0.010115679,
"severe_toxicity_score": 0.001115799,
"identity_attack_score": 0.0026638457,
"insult_score": 0.007322875,
"profanity_score": 0.015010698,
"threat_score": 0.0071588317,
"sexually_explicit_score": 0.012031343,
"flirtation_score": 0.200848
},
"main.bbl": {
"toxicity_score": 0.012314741,
"severe_toxicity_score": 0.0012016296,
"identity_attack_score": 0.0041067624,
"insult_score": 0.007797878,
"profanity_score": 0.015181494,
"threat_score": 0.007586042,
"sexually_explicit_score": 0.011264639,
"flirtation_score": 0.20508216
},
"sec/section5.tex": {
"toxicity_score": 0.016838523,
"severe_toxicity_score": 0.0010919571,
"identity_attack_score": 0.0037737815,
"insult_score": 0.00815888,
"profanity_score": 0.013644327,
"threat_score": 0.007870848,
"sexually_explicit_score": 0.009495324,
"flirtation_score": 0.33592758
},
"sec/section3.tex": {
"toxicity_score": 0.112333365,
"severe_toxicity_score": 0.0032806396,
"identity_attack_score": 0.006881601,
"insult_score": 0.034672357,
"profanity_score": 0.08807703,
"threat_score": 0.008065036,
"sexually_explicit_score": 0.030196311,
"flirtation_score": 0.2418273
}
},
"reason": null
}
} | {
"num_done": {
"figure": 0,
"algorithm": 3,
"plot": 0
}
} | {
"NonTrivialRenderingFilter": {
"white_pixels_ratio": 91.39439892012867,
"hash": "0d8f831fbf878300",
"most_frequent_color_ratio": 91.39439892012867
}
} | [] | "algorithm" | "845af096-d4f2-4f54-96bd-5d99fe1e642a" | 861 | medium |
|
\begin{algorithmic}[1]
\Require $n \geq 0 \vee x \neq 0$
\Ensure $y = x^n$
\State $y \Leftarrow 1$
\If{$n < 0$}\label{algln2}
\State $X \Leftarrow 1 / x$
\State $N \Leftarrow -n$
\Else
\State $X \Leftarrow x$
\State $N \Leftarrow n$
\EndIf
\While{$N \neq 0$}
\If{$N$ is even}
\State $X \Leftarrow X \times X$
\State $N \Leftarrow N / 2$
\Else[$N$ is odd]
\State $y \Leftarrow y \times X$
\State $N \Leftarrow N - 1$
\EndIf
\EndWhile
\end{algorithmic}
| \begin{algorithmic}
[1]
\Require $n \geq 0 \vee x \neq 0$
\Ensure $y = x^n$
\State $y \Leftarrow 1$
\If{$n < 0$} \State $X \Leftarrow 1 / x$
\State $N \Leftarrow -n$
\Else
\State $X \Leftarrow x$
\State $N \Leftarrow n$
\EndIf
\While{$N \neq 0$}
\If{$N$ is even}
\State $X \Leftarrow X \times X$
\State $N \Leftarrow N / 2$
\Else[$N$ is odd]
\State $y \Leftarrow y \times X$
\State $N \Leftarrow N - 1$
\EndIf
\EndWhile
\end{algorithmic} | "https://arxiv.org/src/2312.05063" | "2312.05063.tar.gz" | "2024-02-25" | {
"title": "individualizing glioma radiotherapy planning by optimization of data and physics-informed discrete loss",
"id": "2312.05063",
"abstract": "brain tumor growth is unique to each patient and extends beyond what is visible in imaging scans, infiltrating surrounding brain tissue. understanding these hidden patient-specific progressions is essential for effective therapies. current treatment plans for brain tumors, such as radiotherapy, typically involve delineating a uniform margin around the visible tumor on pre-treatment scans to target this invisible tumor growth. this \"one size fits all\" approach is derived from population studies and often fails to account for the nuances of individual patient conditions. we present the framework gliodil which infers the full spatial distribution of tumor cell concentration from available multi-modal imaging. this is achieved through the newly introduced method of optimizing the discrete loss (odil), where both data and physics-based constraints are softly assimilated into the solution. our test dataset comprises 152 glioblastoma patients with pre-treatment imaging and post-treatment follow-ups for tumor recurrence monitoring. by blending data-driven techniques with physics-based constraints adapted for complex cases, gliodil enhances recurrence prediction in radiotherapy planning, offering a superior alternative to traditional uniform margins and strict pde adherence.",
"categories": "physics.med-ph cs.na math.na q-bio.qm",
"doi": "",
"created": "2023-12-08",
"updated": "2024-02-25",
"authors": [
"michal balcerak",
"jonas weidner",
"petr karnakov",
"ivan ezhov",
"sergey litvinov",
"petros koumoutsakos",
"ray zirui zhang",
"john s. lowengrub",
"bene wiestler",
"bjoern menze"
],
"affiliation": [],
"url": "https://arxiv.org/abs/2312.05063"
} | "2024-03-15T03:04:49.138400" | {
"ToxicityFilter": {
"text_to_toxicity_attributes": {
"sn-nature.bst": {
"toxicity_score": 0.014827953,
"severe_toxicity_score": 0.0012302399,
"identity_attack_score": 0.0034223017,
"insult_score": 0.008880884,
"profanity_score": 0.015932998,
"threat_score": 0.006861079,
"sexually_explicit_score": 0.010438959,
"flirtation_score": 0.39879754
},
"sn-aps.bst": {
"toxicity_score": 0.025556687,
"severe_toxicity_score": 0.0018978119,
"identity_attack_score": 0.004994711,
"insult_score": 0.0114649,
"profanity_score": 0.021945024,
"threat_score": 0.00789674,
"sexually_explicit_score": 0.020052237,
"flirtation_score": 0.32421535
},
"main.bib": {
"toxicity_score": 0.017089844,
"severe_toxicity_score": 0.001077652,
"identity_attack_score": 0.003366805,
"insult_score": 0.008994885,
"profanity_score": 0.013268576,
"threat_score": 0.0069905366,
"sexually_explicit_score": 0.008138849,
"flirtation_score": 0.34701693
},
"sn-jnl.cls": {
"toxicity_score": 0.011812098,
"severe_toxicity_score": 0.0011396408,
"identity_attack_score": 0.003366805,
"insult_score": 0.007721877,
"profanity_score": 0.01402008,
"threat_score": 0.007145886,
"sexually_explicit_score": 0.010379982,
"flirtation_score": 0.512107
},
"sn-article.tex": {
"toxicity_score": 0.0046494426,
"severe_toxicity_score": 0.00053167343,
"identity_attack_score": 0.001415168,
"insult_score": 0.006011867,
"profanity_score": 0.010569996,
"threat_score": 0.0062396824,
"sexually_explicit_score": 0.006605443,
"flirtation_score": 0.2874154
},
"sn-basic.bst": {
"toxicity_score": 0.018974753,
"severe_toxicity_score": 0.0014209747,
"identity_attack_score": 0.0037367835,
"insult_score": 0.010248893,
"profanity_score": 0.018597418,
"threat_score": 0.0071717775,
"sexually_explicit_score": 0.013977589,
"flirtation_score": 0.29158676
},
"sn-apacite.bst": {
"toxicity_score": 0.020842785,
"severe_toxicity_score": 0.0014591217,
"identity_attack_score": 0.0035332954,
"insult_score": 0.0105148945,
"profanity_score": 0.019143965,
"threat_score": 0.0075083673,
"sexually_explicit_score": 0.015216109,
"flirtation_score": 0.39166427
},
"fig.eps": {
"toxicity_score": 0.0058118035,
"severe_toxicity_score": 0.00071525574,
"identity_attack_score": 0.0011515582,
"insult_score": 0.006344369,
"profanity_score": 0.012175481,
"threat_score": 0.0060196044,
"sexually_explicit_score": 0.0072836806,
"flirtation_score": 0.49011314
},
"sn-chicago.bst": {
"toxicity_score": 0.05205809,
"severe_toxicity_score": 0.0031089783,
"identity_attack_score": 0.00449524,
"insult_score": 0.017872108,
"profanity_score": 0.029050145,
"threat_score": 0.007197669,
"sexually_explicit_score": 0.015334064,
"flirtation_score": 0.22683682
},
"sn-mathphys.bst": {
"toxicity_score": 0.015142105,
"severe_toxicity_score": 0.0013542175,
"identity_attack_score": 0.004236255,
"insult_score": 0.008690883,
"profanity_score": 0.017572641,
"threat_score": 0.007586042,
"sexually_explicit_score": 0.013977589,
"flirtation_score": 0.32881752
},
"main.tex": {
"toxicity_score": 0.011560776,
"severe_toxicity_score": 0.0010442734,
"identity_attack_score": 0.0048837173,
"insult_score": 0.0073798755,
"profanity_score": 0.01442999,
"threat_score": 0.00746953,
"sexually_explicit_score": 0.011618502,
"flirtation_score": 0.24431787
},
"main.bbl": {
"toxicity_score": 0.007351146,
"severe_toxicity_score": 0.000834465,
"identity_attack_score": 0.0024603575,
"insult_score": 0.00654387,
"profanity_score": 0.012585391,
"threat_score": 0.006647474,
"sexually_explicit_score": 0.009200439,
"flirtation_score": 0.5493274
},
"sn-vancouver.bst": {
"toxicity_score": 0.010995304,
"severe_toxicity_score": 0.0008535385,
"identity_attack_score": 0.0033298072,
"insult_score": 0.007797878,
"profanity_score": 0.013268576,
"threat_score": 0.0067316215,
"sexually_explicit_score": 0.008256803,
"flirtation_score": 0.4476301
},
"empty.eps": {
"toxicity_score": 0.007885204,
"severe_toxicity_score": 0.0008249283,
"identity_attack_score": 0.0019146391,
"insult_score": 0.0067908717,
"profanity_score": 0.013268576,
"threat_score": 0.006699257,
"sexually_explicit_score": 0.008492713,
"flirtation_score": 0.45258012
}
},
"reason": null
}
} | {
"num_done": {
"table": 1,
"figure": 0,
"algorithm": 2,
"plot": 0
}
} | {
"NonTrivialRenderingFilter": {
"white_pixels_ratio": 96.32356487712283,
"hash": "003f3f7f1f1f3f3f",
"most_frequent_color_ratio": 96.32356487712283
}
} | [] | "algorithm" | "37f9ec91-081a-4799-9d19-7a6595228dc9" | 437 | easy |
|
\begin{algorithmic}[1]
\State Compute the set
\begin{equation*}
I(\mathbf{x}) = \left\{i \in \{1, \dots, N\} : \mathbf{x} \in \mathcal{B}_i\right\}.
\end{equation*}
\If{$|I(\mathbf{x})|=1$}
\State Assign $C(\mathbf{x})$ the unique element of $I(\mathbf{x})$.
\EndIf
\If{$|I(\mathbf{x})| = 0$}
\State $C(\mathbf{x}) = \arg\min_i d(\mathbf{x},\mathcal{B}_i)$.
\EndIf
\If{$|I(\mathbf{x})| > 1$}
\State $C(\mathbf{x}) = \arg\min_i \tilde{d}(\mathbf{x},\mathcal{B}_i)$.
\EndIf
\end{algorithmic}
| \begin{algorithmic}
[1]
\State Compute the set
\begin{equation*}
I(\mathbf{x}) = \left\{i \in \{1, \dots, N\} : \mathbf{x} \in \mathcal{B}_i\right\}.
\end{equation*}
\If{$|I(\mathbf{x})|=1$}
\State Assign $C(\mathbf{x})$ the unique element of $I(\mathbf{x})$.
\EndIf
\If{$|I(\mathbf{x})| = 0$}
\State $C(\mathbf{x}) = \arg\min_i d(\mathbf{x},\mathcal{B}_i)$.
\EndIf
\If{$|I(\mathbf{x})| > 1$}
\State $C(\mathbf{x}) = \arg\min_i \tilde{d}(\mathbf{x},\mathcal{B}_i)$.
\EndIf
\end{algorithmic} | "https://arxiv.org/src/2301.09734" | "2301.09734.tar.gz" | "2024-02-08" | {
"title": "topological learning in multi-class data sets",
"id": "2301.09734",
"abstract": "we specialize techniques from topological data analysis to the problem of characterizing the topological complexity (as defined in the body of the paper) of a multi-class data set. as a by-product, a topological classifier is defined that uses an open sub-covering of the data set. this sub-covering can be used to construct a simplicial complex whose topological features (e.g., betti numbers) provide information about the classification problem. we use these topological constructs to study the impact of topological complexity on learning in feedforward deep neural networks (dnns). we hypothesize that topological complexity is negatively correlated with the ability of a fully connected feedforward deep neural network to learn to classify data correctly. we evaluate our topological classification algorithm on multiple constructed and open source data sets. we also validate our hypothesis regarding the relationship between topological complexity and learning in dnn's on multiple data sets.",
"categories": "cs.lg physics.data-an",
"doi": "",
"created": "2023-01-23",
"updated": "2024-02-08",
"authors": [
"christopher griffin",
"trevor karn",
"benjamin apple"
],
"affiliation": [],
"url": "https://arxiv.org/abs/2301.09734"
} | "2024-03-15T05:24:48.442243" | {
"ToxicityFilter": {
"text_to_toxicity_attributes": {
"main.tex": {
"toxicity_score": 0.01608456,
"severe_toxicity_score": 0.0013446808,
"identity_attack_score": 0.0022198714,
"insult_score": 0.008633883,
"profanity_score": 0.014532468,
"threat_score": 0.006763986,
"sexually_explicit_score": 0.008610667,
"flirtation_score": 0.30276403
},
"main.bbl": {
"toxicity_score": 0.010555492,
"severe_toxicity_score": 0.0010204315,
"identity_attack_score": 0.0034592997,
"insult_score": 0.0073988754,
"profanity_score": 0.013849284,
"threat_score": 0.007870848,
"sexually_explicit_score": 0.010910776,
"flirtation_score": 0.512737
},
"TopologyPaper.bib": {
"toxicity_score": 0.015707577,
"severe_toxicity_score": 0.0012588501,
"identity_attack_score": 0.0058826595,
"insult_score": 0.008975885,
"profanity_score": 0.01620627,
"threat_score": 0.0077154995,
"sexually_explicit_score": 0.0129749775,
"flirtation_score": 0.45469284
}
},
"reason": null
}
} | {
"num_done": {
"figure": 0,
"algorithm": 3,
"plot": 0
}
} | {
"NonTrivialRenderingFilter": {
"white_pixels_ratio": 91.60868197546398,
"hash": "011f1f009fbf3f7f",
"most_frequent_color_ratio": 91.60868197546398
}
} | [] | "algorithm" | "be38228b-6714-4f2a-987e-5364b1359ad6" | 490 | easy |
|
\begin{algorithmic}
\State Initialize \(k=1, \mathbf{w}\sim Uniform(|\Phi|)\)
\While{\(k<k_{max}\)}
\State \(\hat{J}=-\infty\)
\For{\(\sigma_{\text{test}} \in [0,1]\)}
\If{\(J(\mathbf{w}, \sigma_{\text{test}}) > \hat{J}\)}
\State \(\sigma \gets \sigma_{\text{test}}\)
\State \(\hat{J} \gets J(\mathbf{w}, \sigma_{\text{test}})\)
\EndIf
\EndFor
\State Compute gradient \(\nabla_\mathbf{w} J(\mathbf{w},\sigma)\)
\State \(\mathbf{w} \gets \text{Proj}_{L_2}(\mathbf{w} - \alpha \nabla_\mathbf{w} J(\mathbf{w},\sigma))\)
\If{\(\left\|\nabla_\mathbf{w} J(\mathbf{w},\sigma) - \frac{\nabla_\mathbf{w} J(\mathbf{w},\sigma)^\top \mathbf{w}}{\|\mathbf{w}\|^2} \mathbf{w}\right\| < \beta\)}
\State terminate with \(\mathbf{w}\).
\EndIf
\State \(k\gets k+1\)
\EndWhile
\end{algorithmic}
| \begin{algorithmic}
\State Initialize \(k=1, \mathbf{w}\sim Uniform(|\Phi|)\)
\While{\(k<k_{max}\)}
\State \(\hat{J}=-\infty\)
\For{\(\sigma_{\text{test}} \in [0,1]\)}
\If{\(J(\mathbf{w}, \sigma_{\text{test}}) > \hat{J}\)}
\State \(\sigma \gets \sigma_{\text{test}}\)
\State \(\hat{J} \gets J(\mathbf{w}, \sigma_{\text{test}})\)
\EndIf
\EndFor
\State Compute gradient \(\nabla_\mathbf{w} J(\mathbf{w},\sigma)\)
\State \(\mathbf{w} \gets \text{Proj}_{L_2}(\mathbf{w} - \alpha \nabla_\mathbf{w} J(\mathbf{w},\sigma))\)
\If{\(\left\|\nabla_\mathbf{w} J(\mathbf{w},\sigma) - \frac{\nabla_\mathbf{w} J(\mathbf{w},\sigma)^\top \mathbf{w}}{\|\mathbf{w}\|^2} \mathbf{w}\right\| < \beta\)}
\State terminate with \(\mathbf{w}\).
\EndIf
\State \(k\gets k+1\)
\EndWhile
\end{algorithmic} | "https://arxiv.org/src/2207.06392" | "2207.06392.tar.gz" | "2024-01-25" | {
"title": "relationship design for socially-aware behavior in static games",
"id": "2207.06392",
"abstract": "autonomous agents can adopt socially-aware behaviors to reduce social costs, mimicking the way animals interact in nature and humans in society. we present a new approach to model socially-aware decision-making that includes two key elements: bounded rationality and inter-agent relationships. we capture the interagent relationships by introducing a novel model called a relationship game and encode agents' bounded rationality using quantal response equilibria. for each relationship game, we define a social cost function and formulate a mechanism design problem to optimize weights for relationships that minimize social cost at the equilibrium. we address the multiplicity of equilibria by presenting the problem in two forms: min-max and min-min, aimed respectively at minimization of the highest and lowest social costs in the equilibria. we compute the quantal response equilibrium by solving a least-squares problem defined with its karush-kuhn-tucker conditions, and propose two projected gradient descent algorithms to solve the mechanism design problems. numerical results, including two-lane congestion and congestion with an ambulance, confirm that these algorithms consistently reach the equilibrium with the intended social costs.",
"categories": "cs.ma cs.sy eess.sy",
"doi": "",
"created": "2022-07-13",
"updated": "2024-01-25",
"authors": [
"shenghui chen",
"yigit e. bayiz",
"david fridovich-keil",
"ufuk topcu"
],
"affiliation": [],
"url": "https://arxiv.org/abs/2207.06392"
} | "2024-03-15T08:38:27.674079" | {
"ToxicityFilter": {
"text_to_toxicity_attributes": {
"sections/3_preliminaries.tex": {
"toxicity_score": 0.007382561,
"severe_toxicity_score": 0.00079631805,
"identity_attack_score": 0.0020071338,
"insult_score": 0.0063918694,
"profanity_score": 0.012551232,
"threat_score": 0.0067057298,
"sexually_explicit_score": 0.009849187,
"flirtation_score": 0.3320499
},
"eqs_data/eqs.dat": {
"toxicity_score": 0.010806813,
"severe_toxicity_score": 0.0011539459,
"identity_attack_score": 0.0033298072,
"insult_score": 0.007778878,
"profanity_score": 0.013985921,
"threat_score": 0.0072882893,
"sexually_explicit_score": 0.010733845,
"flirtation_score": 0.17414871
},
"sections/appendix_inverse.tex": {
"toxicity_score": 0.003644158,
"severe_toxicity_score": 0.0003695488,
"identity_attack_score": 0.00086020015,
"insult_score": 0.0059453663,
"profanity_score": 0.009562299,
"threat_score": 0.005647414,
"sexually_explicit_score": 0.0049245935,
"flirtation_score": 0.24922791
},
"sn-mathphys.bst": {
"toxicity_score": 0.015142105,
"severe_toxicity_score": 0.0013542175,
"identity_attack_score": 0.004236255,
"insult_score": 0.008690883,
"profanity_score": 0.017572641,
"threat_score": 0.007586042,
"sexually_explicit_score": 0.013977589,
"flirtation_score": 0.32881752
},
"convergence_data/bee_queen_0.3.dat": {
"toxicity_score": 0.012691722,
"severe_toxicity_score": 0.0012207031,
"identity_attack_score": 0.0019608864,
"insult_score": 0.00808288,
"profanity_score": 0.013063621,
"threat_score": 0.007068211,
"sexually_explicit_score": 0.011677479,
"flirtation_score": 0.30249768
},
"sections/2_related.tex": {
"toxicity_score": 0.005937464,
"severe_toxicity_score": 0.0005841255,
"identity_attack_score": 0.0017851467,
"insult_score": 0.0062208683,
"profanity_score": 0.011697251,
"threat_score": 0.00636914,
"sexually_explicit_score": 0.008315781,
"flirtation_score": 0.2784857
},
"convergence_data/congestion_0.3.dat": {
"toxicity_score": 0.012691722,
"severe_toxicity_score": 0.0012207031,
"identity_attack_score": 0.0019608864,
"insult_score": 0.00808288,
"profanity_score": 0.013063621,
"threat_score": 0.007068211,
"sexually_explicit_score": 0.011677479,
"flirtation_score": 0.30249768
},
"sections/5_method.tex": {
"toxicity_score": 0.008482091,
"severe_toxicity_score": 0.00066280365,
"identity_attack_score": 0.0029043318,
"insult_score": 0.006667371,
"profanity_score": 0.012551232,
"threat_score": 0.006977591,
"sexually_explicit_score": 0.009023507,
"flirtation_score": 0.18856962
},
"convergence_data/congestion_0.5.dat": {
"toxicity_score": 0.012691722,
"severe_toxicity_score": 0.0012207031,
"identity_attack_score": 0.0019608864,
"insult_score": 0.00808288,
"profanity_score": 0.013063621,
"threat_score": 0.007068211,
"sexually_explicit_score": 0.011677479,
"flirtation_score": 0.30249768
},
"sections/1_introduction.tex": {
"toxicity_score": 0.006754258,
"severe_toxicity_score": 0.00067710876,
"identity_attack_score": 0.0019146391,
"insult_score": 0.0064393696,
"profanity_score": 0.012243799,
"threat_score": 0.0065180166,
"sexually_explicit_score": 0.009318393,
"flirtation_score": 0.27036667
},
"sections/4_problem.tex": {
"toxicity_score": 0.014890783,
"severe_toxicity_score": 0.0007915497,
"identity_attack_score": 0.005105704,
"insult_score": 0.007778878,
"profanity_score": 0.013234417,
"threat_score": 0.007081157,
"sexually_explicit_score": 0.013210886,
"flirtation_score": 0.24914093
},
"sn-jnl.cls": {
"toxicity_score": 0.011812098,
"severe_toxicity_score": 0.0011396408,
"identity_attack_score": 0.003366805,
"insult_score": 0.007721877,
"profanity_score": 0.01402008,
"threat_score": 0.007145886,
"sexually_explicit_score": 0.010379982,
"flirtation_score": 0.512107
},
"sn-article.bbl": {
"toxicity_score": 0.007351146,
"severe_toxicity_score": 0.000834465,
"identity_attack_score": 0.0024603575,
"insult_score": 0.00654387,
"profanity_score": 0.012585391,
"threat_score": 0.006647474,
"sexually_explicit_score": 0.009200439,
"flirtation_score": 0.5493274
},
"convergence_data/bee_queen_0.7.dat": {
"toxicity_score": 0.012691722,
"severe_toxicity_score": 0.0012207031,
"identity_attack_score": 0.0019608864,
"insult_score": 0.00808288,
"profanity_score": 0.013063621,
"threat_score": 0.007068211,
"sexually_explicit_score": 0.011677479,
"flirtation_score": 0.30249768
},
"eqs_data/eqs_max.dat": {
"toxicity_score": 0.010806813,
"severe_toxicity_score": 0.0011539459,
"identity_attack_score": 0.0033298072,
"insult_score": 0.007778878,
"profanity_score": 0.013985921,
"threat_score": 0.0072882893,
"sexually_explicit_score": 0.010733845,
"flirtation_score": 0.17414871
},
"ref.bib": {
"toxicity_score": 0.00719407,
"severe_toxicity_score": 0.001206398,
"identity_attack_score": 0.0013874196,
"insult_score": 0.0066863713,
"profanity_score": 0.013780965,
"threat_score": 0.006045496,
"sexually_explicit_score": 0.0115595255,
"flirtation_score": 0.33316135
},
"convergence_data/congestion_0.7.dat": {
"toxicity_score": 0.012691722,
"severe_toxicity_score": 0.0012207031,
"identity_attack_score": 0.0019608864,
"insult_score": 0.00808288,
"profanity_score": 0.013063621,
"threat_score": 0.007068211,
"sexually_explicit_score": 0.011677479,
"flirtation_score": 0.30249768
},
"sn-article.tex": {
"toxicity_score": 0.0046494426,
"severe_toxicity_score": 0.00053167343,
"identity_attack_score": 0.001415168,
"insult_score": 0.006011867,
"profanity_score": 0.010569996,
"threat_score": 0.0062396824,
"sexually_explicit_score": 0.006605443,
"flirtation_score": 0.2874154
},
"eqs_data/eqs_equals.dat": {
"toxicity_score": 0.010806813,
"severe_toxicity_score": 0.0011539459,
"identity_attack_score": 0.0033298072,
"insult_score": 0.007778878,
"profanity_score": 0.013985921,
"threat_score": 0.0072882893,
"sexually_explicit_score": 0.010733845,
"flirtation_score": 0.17414871
},
"convergence_data/bee_queen_0.5.dat": {
"toxicity_score": 0.012691722,
"severe_toxicity_score": 0.0012207031,
"identity_attack_score": 0.0019608864,
"insult_score": 0.00808288,
"profanity_score": 0.013063621,
"threat_score": 0.007068211,
"sexually_explicit_score": 0.011677479,
"flirtation_score": 0.30249768
},
"sections/6_numerical.tex": {
"toxicity_score": 0.0062516155,
"severe_toxicity_score": 0.0005722046,
"identity_attack_score": 0.0020256327,
"insult_score": 0.006296869,
"profanity_score": 0.011389818,
"threat_score": 0.006356194,
"sexually_explicit_score": 0.007961918,
"flirtation_score": 0.32268935
},
"eqs_data/eqs_min.dat": {
"toxicity_score": 0.010806813,
"severe_toxicity_score": 0.0011539459,
"identity_attack_score": 0.0033298072,
"insult_score": 0.007778878,
"profanity_score": 0.013985921,
"threat_score": 0.0072882893,
"sexually_explicit_score": 0.010733845,
"flirtation_score": 0.17414871
},
"sections/7_conclusion.tex": {
"toxicity_score": 0.006440107,
"severe_toxicity_score": 0.00067710876,
"identity_attack_score": 0.0016186562,
"insult_score": 0.006315869,
"profanity_score": 0.011816809,
"threat_score": 0.006427396,
"sexually_explicit_score": 0.008256803,
"flirtation_score": 0.22920927
}
},
"reason": null
}
} | {
"num_done": {
"figure": 0,
"algorithm": 3
}
} | {
"NonTrivialRenderingFilter": {
"white_pixels_ratio": 92.73401572466993,
"hash": "0707821f07bf9f3f",
"most_frequent_color_ratio": 92.73401572466993
}
} | [] | "algorithm" | "b6fcbba0-8428-4ca6-90b8-c0ab8babb1b1" | 775 | medium |
|
\begin{algorithm}[!ht]\caption{LSH, private procedures}\label{alg:LSH_private_app}
\begin{algorithmic}[1]
\State {\bf data structure} \textsc{LSH}
\State
\State {\bf private}
\Procedure{\textsc{ChooseHashFunc}}{$k,L\in \mathbb{N}_+$}\label{lin:choose_hash_func}
\For{$l \in [L]$}
\State \Comment{Amplify hash functions by concatenating}
\State $\mathcal{H}_{l} \leftarrow$ sample $k$ hash functions $(f_{1,l},f_{2,l},\cdots,f_{k,l})$ from $\mathcal{H}$ \label{lin:LSH_sample_k_functions}
\EndFor
\EndProcedure
\State
\Procedure{\textsc{ConstructHashTable}}{$\{x_i\}_{i\in[n]}\subset \mathbb{R}^d$}\label{lin:construct_hash_table}
\For{$l\in [L]$}
\For{$i\in [n]$}
\State $\mathcal{H}_l(x_i)$.\textsc{Insert}($x_i$) \label{lin:find_bucket_insert_element}
\State $\mathcal{T}_l\leftarrow \mathcal{T}_l\cup \mathcal{H}_l(x_i)$ \Comment{Creat hashtable by aggregating buckets} \label{lin:aggregate_hash_table}
\EndFor
\EndFor
\EndProcedure
\State {\bf end data structure}
\end{algorithmic}
\end{algorithm}
| \begin{algorithm}[!ht]
\caption{LSH, private procedures}\begin{algorithmic}
[1]
\State {\bf data structure} \textsc{LSH}
\State
\State {\bf private}
\Procedure{\textsc{ChooseHashFunc}}{$k,L\in \mathbb{N}_+$} \For{$l \in [L]$}
\State \Comment{Amplify hash functions by concatenating}
\State $\mathcal{H}_{l} \leftarrow$ sample $k$ hash functions $(f_{1,l},f_{2,l},\cdots,f_{k,l})$ from $\mathcal{H}$ \EndFor
\EndProcedure
\State
\Procedure{\textsc{ConstructHashTable}}{$\{x_i\}_{i\in[n]}\subset \mathbb{R}^d$} \For{$l\in [L]$}
\For{$i\in [n]$}
\State $\mathcal{H}_l(x_i)$.\textsc{Insert}($x_i$) \State $\mathcal{T}_l\leftarrow \mathcal{T}_l\cup \mathcal{H}_l(x_i)$ \Comment{Creat hashtable by aggregating buckets} \EndFor
\EndFor
\EndProcedure
\State {\bf end data structure}
\end{algorithmic}
\end{algorithm} | "https://arxiv.org/src/2208.03915" | "2208.03915.tar.gz" | "2024-02-13" | {
"title": "dynamic maintenance of kernel density estimation data structure: from practice to theory",
"id": "2208.03915",
"abstract": "kernel density estimation (kde) stands out as a challenging task in machine learning. the problem is defined in the following way: given a kernel function $f(x,y)$ and a set of points $\\{x_1, x_2, \\cdots, x_n \\} \\subset \\mathbb{r}^d$, we would like to compute $\\frac{1}{n}\\sum_{i=1}^{n} f(x_i,y)$ for any query point $y \\in \\mathbb{r}^d$. recently, there has been a growing trend of using data structures for efficient kde. however, the proposed kde data structures focus on static settings. the robustness of kde data structures over dynamic changing data distributions is not addressed. in this work, we focus on the dynamic maintenance of kde data structures with robustness to adversarial queries. especially, we provide a theoretical framework of kde data structures. in our framework, the kde data structures only require subquadratic spaces. moreover, our data structure supports the dynamic update of the dataset in sublinear time. furthermore, we can perform adaptive queries with the potential adversary in sublinear time.",
"categories": "cs.lg stat.ml",
"doi": "",
"created": "2022-08-08",
"updated": "2024-02-13",
"authors": [
"jiehao liang",
"zhao song",
"zhaozhuo xu",
"junze yin",
"danyang zhuo"
],
"affiliation": [],
"url": "https://arxiv.org/abs/2208.03915"
} | "2024-03-15T05:43:39.046127" | {
"ToxicityFilter": {
"text_to_toxicity_attributes": {
"preli.tex": {
"toxicity_score": 0.00609454,
"severe_toxicity_score": 0.0007247925,
"identity_attack_score": 0.0016834025,
"insult_score": 0.0062493687,
"profanity_score": 0.012073003,
"threat_score": 0.0064532873,
"sexually_explicit_score": 0.009200439,
"flirtation_score": 0.29065508
},
"app_adversary.tex": {
"toxicity_score": 0.017718147,
"severe_toxicity_score": 0.001821518,
"identity_attack_score": 0.003311308,
"insult_score": 0.00806388,
"profanity_score": 0.016616182,
"threat_score": 0.008323951,
"sexually_explicit_score": 0.016159745,
"flirtation_score": 0.24439204
},
"app_correctness.tex": {
"toxicity_score": 0.0066600125,
"severe_toxicity_score": 0.0005531311,
"identity_attack_score": 0.0016464046,
"insult_score": 0.00647737,
"profanity_score": 0.010962827,
"threat_score": 0.0063238298,
"sexually_explicit_score": 0.0064285113,
"flirtation_score": 0.25106943
},
"app_data.tex": {
"toxicity_score": 0.01017851,
"severe_toxicity_score": 0.0010347366,
"identity_attack_score": 0.003884775,
"insult_score": 0.007009373,
"profanity_score": 0.0138151245,
"threat_score": 0.007573096,
"sexually_explicit_score": 0.011441571,
"flirtation_score": 0.18818803
},
"conclusion.tex": {
"toxicity_score": 0.007979449,
"severe_toxicity_score": 0.0006580353,
"identity_attack_score": 0.001655654,
"insult_score": 0.0067623714,
"profanity_score": 0.012517073,
"threat_score": 0.006382086,
"sexually_explicit_score": 0.008256803,
"flirtation_score": 0.26385543
},
"abstract.tex": {
"toxicity_score": 0.014450971,
"severe_toxicity_score": 0.00089645386,
"identity_attack_score": 0.00414376,
"insult_score": 0.008367881,
"profanity_score": 0.013371054,
"threat_score": 0.0074565844,
"sexually_explicit_score": 0.008197826,
"flirtation_score": 0.14363346
},
"app_preli.tex": {
"toxicity_score": 0.009236055,
"severe_toxicity_score": 0.0010347366,
"identity_attack_score": 0.0030523231,
"insult_score": 0.0069048726,
"profanity_score": 0.014088398,
"threat_score": 0.007365964,
"sexually_explicit_score": 0.010792822,
"flirtation_score": 0.38172203
},
"adversary.tex": {
"toxicity_score": 0.033806015,
"severe_toxicity_score": 0.0017356873,
"identity_attack_score": 0.0065856185,
"insult_score": 0.010476895,
"profanity_score": 0.018187506,
"threat_score": 0.011249693,
"sexually_explicit_score": 0.018164968,
"flirtation_score": 0.30483255
},
"app_lipschitz.tex": {
"toxicity_score": 0.010429831,
"severe_toxicity_score": 0.0018596649,
"identity_attack_score": 0.0013226734,
"insult_score": 0.007341875,
"profanity_score": 0.02071529,
"threat_score": 0.0060325502,
"sexually_explicit_score": 0.020759964,
"flirtation_score": 0.67361206
},
"main.tex": {
"toxicity_score": 0.022256956,
"severe_toxicity_score": 0.0015354156,
"identity_attack_score": 0.0055496786,
"insult_score": 0.010172892,
"profanity_score": 0.01982715,
"threat_score": 0.008738215,
"sexually_explicit_score": 0.012621114,
"flirtation_score": 0.25408843
},
"correctness.tex": {
"toxicity_score": 0.009738698,
"severe_toxicity_score": 0.0007009506,
"identity_attack_score": 0.0026083488,
"insult_score": 0.0072848746,
"profanity_score": 0.012141321,
"threat_score": 0.006757513,
"sexually_explicit_score": 0.007961918,
"flirtation_score": 0.33721492
},
"intro.tex": {
"toxicity_score": 0.006942749,
"severe_toxicity_score": 0.0007390976,
"identity_attack_score": 0.0022753682,
"insult_score": 0.0064488696,
"profanity_score": 0.012687869,
"threat_score": 0.0066798385,
"sexually_explicit_score": 0.009554301,
"flirtation_score": 0.2300378
},
"main.bbl": {
"toxicity_score": 0.01646154,
"severe_toxicity_score": 0.0016784668,
"identity_attack_score": 0.0030523231,
"insult_score": 0.00808288,
"profanity_score": 0.01941724,
"threat_score": 0.008129764,
"sexually_explicit_score": 0.01710338,
"flirtation_score": 0.283342
},
"technical.tex": {
"toxicity_score": 0.0033614214,
"severe_toxicity_score": 0.0004029274,
"identity_attack_score": 0.0008786991,
"insult_score": 0.005726865,
"profanity_score": 0.00997221,
"threat_score": 0.0057347976,
"sexually_explicit_score": 0.005337434,
"flirtation_score": 0.30908814
},
"app_technical.tex": {
"toxicity_score": 0.009864358,
"severe_toxicity_score": 0.0012493134,
"identity_attack_score": 0.0027933381,
"insult_score": 0.0072658747,
"profanity_score": 0.014532468,
"threat_score": 0.0070552654,
"sexually_explicit_score": 0.0108517995,
"flirtation_score": 0.22984806
},
"ref.bib": {
"toxicity_score": 0.013445686,
"severe_toxicity_score": 0.0014781952,
"identity_attack_score": 0.0024048607,
"insult_score": 0.0081208795,
"profanity_score": 0.016616182,
"threat_score": 0.007068211,
"sexually_explicit_score": 0.012857023,
"flirtation_score": 0.40251273
},
"data.tex": {
"toxicity_score": 0.011812098,
"severe_toxicity_score": 0.0011491776,
"identity_attack_score": 0.0044582416,
"insult_score": 0.0074368757,
"profanity_score": 0.014669105,
"threat_score": 0.007883795,
"sexually_explicit_score": 0.012916001,
"flirtation_score": 0.23941755
}
},
"reason": null
}
} | {
"num_done": {
"figure": 0,
"algorithm": 3,
"plot": 0
}
} | {
"NonTrivialRenderingFilter": {
"white_pixels_ratio": 92.56386257114235,
"hash": "34a0101f1f3f3f1f",
"most_frequent_color_ratio": 92.56386257114235
}
} | [] | "algorithm" | "df723daa-5bbd-4dcf-a0b8-28a7b34143bd" | 808 | medium |
End of preview. Expand
in Dataset Viewer.
Image2Struct - Latex
Paper | Website | Datasets (Webpages, Latex, Music sheets) | Leaderboard | HELM repo | Image2Struct repo
License: Apache License Version 2.0, January 2004
Dataset description
Image2struct is a benchmark for evaluating vision-language models in practical tasks of extracting structured information from images.
This subdataset focuses on LaTeX code. The model is given an image of the expected output with the prompt:
Please provide the LaTex code used to generate this image. Only generate the code relevant to what you see. Your code will be surrounded by all the imports necessary as well as the begin and end document delimiters.
The subjects were collected on ArXiv and are: eess, cs, stat, math, physics, econ, q-bio, q-fin.
The dataset is divided into 5 categories. There are 4 categories that are collected automatically using the Image2Struct repo:
- equations
- tables
- algorithms
- code
The last category: wild, was collected by taking screenshots of equations in the Wikipedia page of "equation" and its related pages.
Uses
To load the subset equation of the dataset to be sent to the model under evaluation in Python:
import datasets
datasets.load_dataset("stanford-crfm/i2s-latex", "equation", split="validation")
To evaluate a model on Image2Latex (equation) using HELM, run the following command-line commands:
pip install crfm-helm
helm-run --run-entries image2latex:subset=equation,model=vlm --models-to-run google/gemini-pro-vision --suite my-suite-i2s --max-eval-instances 10
You can also run the evaluation for only a specific subset and difficulty:
helm-run --run-entries image2latex:subset=equation,difficulty=hard,model=vlm --models-to-run google/gemini-pro-vision --suite my-suite-i2s --max-eval-instances 10
For more information on running Image2Struct using HELM, refer to the HELM documentation and the article on reproducing leaderboards.
Citation
BibTeX:
@misc{roberts2024image2struct,
title={Image2Struct: A Benchmark for Evaluating Vision-Language Models in Extracting Structured Information from Images},
author={Josselin Somerville Roberts and Tony Lee and Chi Heem Wong and Michihiro Yasunaga and Yifan Mai and Percy Liang},
year={2024},
eprint={TBD},
archivePrefix={arXiv},
primaryClass={TBD}
}
- Downloads last month
- 503