{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/u-rnns","slug":"u-rnns","name":"U-RNNs","full_name":"Asymmetrical Bi-RNN","full_name_withheld":false,"description_markdown":"An aspect of Bi-RNNs that could be undesirable is the architecture's symmetry in both time directions.\r\n\r\n Bi-RNNs are often used in natural language processing, where the order of the words is almost exclusively determined by grammatical rules and not by temporal sequentiality.  However, in some cases, the data has a preferred direction in time: the forward direction. \r\n\r\nAnother potential drawback of Bi-RNNs is that their output is simply the concatenation of two naive readings of the input in both directions. In consequence, Bi-RNNs never actually read an input by knowing what happens in the future. Conversely, the idea behind U-RNN, is to first do a backward pass, and then use during the forward pass information about the future.\r\n\r\nWe accumulate information while knowing which part of the information will be useful in the future as it should be relevant to do so if the forward direction is the preferred direction of the data.\r\n\r\nThe backward and forward hidden states $(h^b_t)$ and  $(h^f_t)$ are obtained according to these equations:\r\n\r\n\\begin{equation}\r\n\\begin{aligned}\r\n&h_{t-1}^{b}=R N N\\left(h_{t}^{b}, e_{t}, W_{b}\\right) \\\\\r\n&h_{t+1}^{f}=R N N\\left(h_{t}^{f},\\left[e_{t}, h_{t}^{b}\\right], W_{f}\\right)\r\n\\end{aligned}\r\n\\end{equation}\r\n\r\nwhere $W_b$ and $W_f$ are learnable weights that are shared among pedestrians, and $[\\cdot, \\cdot]$ denotes concatenation. The last hidden state $h^f_{T_{obs}}$ is then used as the encoding of the sequence.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Asymmetrical Bi-RNN for pedestrian trajectory encoding","paper":"/paper/asymmetrical-bi-rnn-for-pedestrian-trajectory","first_author":"Raphaël Rozenberg","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/asymmetrical-bi-rnn-for-pedestrian-trajectory"},"source":{"url":"https://arxiv.org/abs/2106.04419v2","title":"Asymmetrical Bi-RNN for pedestrian trajectory encoding","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/JosephGesnouin/Asymmetrical-Bi-RNNs-to-encode-pedestrian-trajectories","code_snippet_url_on_a_code_host":true,"categories":[{"area":"Sequential","area_id":"sequential","collection":"Bidirectional Recurrent Neural Networks","url":"/methods/category/bidirectional-recurrent-neural-networks","pwc_aliases":[]}],"n_papers_tagged":2,"archive_num_papers":2,"papers_newest_first":[{"paper":null,"slug":"trouspi-net-spatio-temporal-attention-on","title":"TrouSPI-Net: Spatio-temporal attention on parallel atrous convolutions and U-GRUs for skeletal pedestrian crossing prediction","date":"2021-09-02","arxiv_id":"2109.00953","n_code_links":0,"syntology":null},{"paper":"/paper/asymmetrical-bi-rnn-for-pedestrian-trajectory","slug":"asymmetrical-bi-rnn-for-pedestrian-trajectory","title":"Asymmetrical Bi-RNN for pedestrian trajectory encoding","date":"2021-06-01","arxiv_id":"2106.04419","n_code_links":1,"syntology":null}],"papers_shown":2,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":2,"with_a_code_link":1,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":2,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[],"tasks":[{"task":"/task/autonomous-driving","name":"Autonomous Driving","papers":1},{"task":"/task/autonomous-navigation","name":"Autonomous Navigation","papers":1},{"task":"/task/pedestrian-trajectory-prediction","name":"Pedestrian Trajectory Prediction","papers":1},{"task":"/task/trajectory-forecasting","name":"Trajectory Forecasting","papers":1},{"task":"/task/trajectory-prediction","name":"Trajectory Prediction","papers":1}],"tasks_shown":5,"n_tasks":5,"usage_by_year":[{"year":"2021","papers":2}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/u-rnns"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=U-RNNs","read_at":"2026-10-05T01:03:22+00:00","query":"U-RNNs","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"2106.04419","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'U-RNNs' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["Banded RNNs","Selective-Update RNNs","Structural Evolution RNNs (SE-RNNs)","Almost-Linear Recurrent Neural Networks (AL-RNNs)","physics-constrained RNNs for temperature nowcasting"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"d4f7b65c781f566e01951816f794eafd8fe900d794cbc98f81b8b8e537e818fc","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}