{"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/simaug","slug":"simaug","name":"SimAug","full_name":"Simulation as Augmentation","full_name_withheld":false,"description_markdown":"**SimAug**, or **Simulation as Augmentation**, is a data augmentation method for trajectory prediction. It augments the representation such that it is robust to the variances in semantic scenes and camera views.  First, to deal with the gap between real and synthetic semantic scene, it represents each training trajectory by high-level scene semantic segmentation features, and defends the model from adversarial examples generated by whitebox attack methods. Second, to overcome the changes in camera views, it generates multiple views for the same trajectory, and encourages the model to focus on the “hardest” view to which the model has learned. The classification loss is adopted and the view with the highest loss is favored during training. Finally, the augmented trajectory is computed as a convex combination of the trajectories generated in previous steps. The trajectory prediction model is built on a multi-scale representation and the final model is trained to minimize the empirical vicinal risk over the distribution of augmented trajectories.","description_state":"present","introduced_year":null,"introduced_by":{"title":"SimAug: Learning Robust Representations from 3D Simulation for Pedestrian Trajectory Prediction in Unseen Cameras","paper":"/paper/simaug-learning-robust-representations-from","first_author":"Junwei Liang","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/simaug-learning-robust-representations-from"},"source":{"url":"https://arxiv.org/abs/2004.02022v2","title":"SimAug: Learning Robust Representations from 3D Simulation for Pedestrian Trajectory Prediction in Unseen Cameras","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Computer Vision","area_id":"computer-vision","collection":"Trajectory Data Augmentation","url":"/methods/category/trajectory-data-augmentation","pwc_aliases":[]},{"area":"General","area_id":"general","collection":"Adversarial Training","url":"/methods/category/adversarial-training","pwc_aliases":[]}],"n_papers_tagged":4,"archive_num_papers":4,"papers_newest_first":[{"paper":"/paper/simaug-enhancing-recommendation-with","slug":"simaug-enhancing-recommendation-with","title":"SimAug: Enhancing Recommendation with Pretrained Language Models for Dense and Balanced Data Augmentation","date":"2025-05-03","arxiv_id":"2505.01695","n_code_links":1,"syntology":null},{"paper":"/paper/joint-analysis-and-prediction-of-human","slug":"joint-analysis-and-prediction-of-human","title":"From Recognition to Prediction: Analysis of Human Action and Trajectory Prediction in Video","date":"2020-11-20","arxiv_id":"2011.10670","n_code_links":4,"syntology":null},{"paper":"/paper/simaug-learning-robust-representations-from-1","slug":"simaug-learning-robust-representations-from-1","title":"SimAug: Learning Robust Representations from Simulation for Trajectory Prediction","date":"2020-08-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/simaug-learning-robust-representations-from","slug":"simaug-learning-robust-representations-from","title":"SimAug: Learning Robust Representations from 3D Simulation for Pedestrian Trajectory Prediction in Unseen Cameras","date":"2020-04-04","arxiv_id":"2004.02022","n_code_links":1,"syntology":null}],"papers_shown":4,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":4,"with_a_code_link":4,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":4,"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/trajectory-prediction","name":"Trajectory Prediction","papers":3},{"task":"/task/adversarial-attack","name":"Adversarial Attack","papers":2},{"task":"/task/adversarial-defense","name":"Adversarial Defense","papers":2},{"task":"/task/pedestrian-trajectory-prediction","name":"Pedestrian Trajectory Prediction","papers":2},{"task":"/task/trajectory-forecasting","name":"Trajectory Forecasting","papers":2},{"task":"/task/action-detection","name":"Action Detection","papers":1},{"task":"/task/autonomous-driving","name":"Autonomous Driving","papers":1},{"task":"/task/collaborative-filtering","name":"Collaborative Filtering","papers":1},{"task":"/task/data-augmentation","name":"Data Augmentation","papers":1},{"task":"/task/fairness","name":"Fairness","papers":1},{"task":"/task/prediction","name":"Prediction","papers":1}],"tasks_shown":11,"n_tasks":11,"usage_by_year":[{"year":"2020","papers":3},{"year":"2025","papers":1}],"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/simaug"},"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=SimAug","read_at":"2026-10-05T01:02:01+00:00","query":"SimAug","kind":"paper","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"2004.02022"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"2004.02022","repositories":{"listed":1,"in_graph":1,"list_truncated":false,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2004.02022","citations":19},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'SimAug'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2004.02022","page":"/paper/simaug-learning-robust-representations-from","syntology_url":"https://syntology.ai/paper/2004.02022","in_graph_layer":false,"samples":0},"line":"repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: official). The lookup matched a paper by its title, arXiv:2004.02022, not a method entry. This answer is about arXiv:2004.02022, the paper the archive credits with this method.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"3d4c2d1fce8e160f80d5ca7cbaef37a1d7b0ed3efda56e7b4425333a1487f75e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}