{"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/normalizing-flows/papers/8","list_of":"/method/normalizing-flows","method":"Normalizing Flows","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"date (newest first), then slug","page":8,"pages_in_order":8,"rows_per_page":100,"rows":[701,771],"of":771,"counts":{"archive_papers_tagged":771,"with_a_code_link":390,"where_syntology_ran_a_sample":122,"not_listed_spam_title":0,"listed":771,"listed_where_code_ran":122,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":99,"every_run_a_failure_of_syntologys_instrument":23,"listed_with_a_run_with_no_instrument_failure":99,"listed_every_run_a_failure_of_syntologys_instrument":23,"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"},"first_page":"/method/normalizing-flows","prev":"/method/normalizing-flows/papers/7","next":null,"papers":[{"paper":null,"slug":"stochastic-gradient-descent-optimizes-over","title":"Stochastic Gradient Descent Optimizes Over-parameterized Deep ReLU Networks","date":"2018-11-21","arxiv_id":"1811.08888","n_code_links":0,"syntology":null},{"paper":null,"slug":"state-aggregation-learning-from-markov","title":"State Aggregation Learning from Markov Transition Data","date":"2018-11-06","arxiv_id":"1811.02619","n_code_links":0,"syntology":null},{"paper":null,"slug":"task-embedded-coordinate-update-a-realizable","title":"Task Embedded Coordinate Update: A Realizable Framework for Multivariate Non-convex Optimization","date":"2018-11-05","arxiv_id":"1811.01587","n_code_links":0,"syntology":null},{"paper":"/paper/waveglow-a-flow-based-generative-network-for","slug":"waveglow-a-flow-based-generative-network-for","title":"WaveGlow: A Flow-based Generative Network for Speech Synthesis","date":"2018-10-31","arxiv_id":"1811.00002","n_code_links":2,"syntology":{"ran":5,"of":7,"n_ran_checked":3,"n_instrument":2,"unverified":2,"pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","official":null}},{"paper":null,"slug":"optimizing-waiting-thresholds-within-a-state","title":"Optimizing Waiting Thresholds Within A State Machine","date":"2018-10-08","arxiv_id":"1810.03278","n_code_links":0,"syntology":null},{"paper":"/paper/boosting-trust-region-policy-optimization-by","slug":"boosting-trust-region-policy-optimization-by","title":"Boosting Trust Region Policy Optimization by Normalizing Flows Policy","date":"2018-09-27","arxiv_id":"1809.10326","n_code_links":1,"syntology":null},{"paper":null,"slug":"online-dictionary-learning-for-approximate","title":"Online Dictionary Learning for Approximate Archetypal Analysis","date":"2018-09-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"making-emphordinary-least-squares-linear","title":"Linear classifier, least-squares cost function, and outliers","date":"2018-08-28","arxiv_id":"1808.09222","n_code_links":0,"syntology":null},{"paper":"/paper/clarinet-parallel-wave-generation-in-end-to","slug":"clarinet-parallel-wave-generation-in-end-to","title":"ClariNet: Parallel Wave Generation in End-to-End Text-to-Speech","date":"2018-07-19","arxiv_id":"1807.07281","n_code_links":5,"syntology":{"ran":10,"of":13,"n_ran_checked":10,"n_instrument":0,"unverified":3,"pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":null}},{"paper":"/paper/introvae-introspective-variational","slug":"introvae-introspective-variational","title":"IntroVAE: Introspective Variational Autoencoders for Photographic Image Synthesis","date":"2018-07-17","arxiv_id":"1807.06358","n_code_links":3,"syntology":null},{"paper":null,"slug":"payoff-control-in-the-iterated-prisoners","title":"Payoff Control in the Iterated Prisoner's Dilemma","date":"2018-07-17","arxiv_id":"1807.06666","n_code_links":0,"syntology":null},{"paper":"/paper/glow-generative-flow-with-invertible-1x1","slug":"glow-generative-flow-with-invertible-1x1","title":"Glow: Generative Flow with Invertible 1x1 Convolutions","date":"2018-07-09","arxiv_id":"1807.03039","n_code_links":27,"syntology":{"ran":85,"of":129,"n_ran_checked":73,"n_instrument":12,"unverified":44,"pointer_only":44,"phrase":"85 ran (of which 47 constructed an object rather than computing a result; 73 with no instrument failure: 3 honoured, 0 violated, 70 with no contract checked; 12 where Syntology's instrument failed) · 44 unverified","official":{"repos":["openai/glow"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/reconet-real-time-coherent-video-style","slug":"reconet-real-time-coherent-video-style","title":"ReCoNet: Real-time Coherent Video Style Transfer Network","date":"2018-07-03","arxiv_id":"1807.01197","n_code_links":8,"syntology":null},{"paper":null,"slug":"implicit-regularization-in-nonconvex-1","title":"Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval and Matrix Completion","date":"2018-07-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/deep-neural-decision-trees","slug":"deep-neural-decision-trees","title":"Deep Neural Decision Trees","date":"2018-06-19","arxiv_id":"1806.06988","n_code_links":5,"syntology":{"ran":1,"of":3,"n_ran_checked":1,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["wOOL/DNDT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/closing-the-generalization-gap-of-adaptive","slug":"closing-the-generalization-gap-of-adaptive","title":"Closing the Generalization Gap of Adaptive Gradient Methods in Training Deep Neural Networks","date":"2018-06-18","arxiv_id":"1806.06763","n_code_links":2,"syntology":null},{"paper":null,"slug":"what-knowledge-is-needed-to-solve-the-rte5","title":"What Knowledge is Needed to Solve the RTE5 Textual Entailment Challenge?","date":"2018-06-10","arxiv_id":"1806.03561","n_code_links":0,"syntology":null},{"paper":"/paper/randomized-value-functions-via-multiplicative","slug":"randomized-value-functions-via-multiplicative","title":"Randomized Value Functions via Multiplicative Normalizing Flows","date":"2018-06-06","arxiv_id":"1806.02315","n_code_links":2,"syntology":null},{"paper":"/paper/online-deep-metric-learning","slug":"online-deep-metric-learning","title":"A Multilayer Framework for Online Metric Learning","date":"2018-05-15","arxiv_id":"1805.05510","n_code_links":1,"syntology":null},{"paper":"/paper/robust-blind-deconvolution-via-mirror-descent","slug":"robust-blind-deconvolution-via-mirror-descent","title":"Robust Blind Deconvolution via Mirror Descent","date":"2018-03-21","arxiv_id":"1803.08137","n_code_links":4,"syntology":null},{"paper":"/paper/large-margin-deep-networks-for-classification","slug":"large-margin-deep-networks-for-classification","title":"Large Margin Deep Networks for Classification","date":"2018-03-15","arxiv_id":"1803.05598","n_code_links":2,"syntology":null},{"paper":"/paper/sylvester-normalizing-flows-for-variational","slug":"sylvester-normalizing-flows-for-variational","title":"Sylvester Normalizing Flows for Variational Inference","date":"2018-03-15","arxiv_id":"1803.05649","n_code_links":2,"syntology":{"ran":3,"of":6,"n_ran_checked":3,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["riannevdberg/sylvester-flows"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"an-alternative-view-when-does-sgd-escape","title":"An Alternative View: When Does SGD Escape Local Minima?","date":"2018-02-17","arxiv_id":"1802.06175","n_code_links":0,"syntology":null},{"paper":"/paper/persistence-fisher-kernel-a-riemannian","slug":"persistence-fisher-kernel-a-riemannian","title":"Persistence Fisher Kernel: A Riemannian Manifold Kernel for Persistence Diagrams","date":"2018-02-10","arxiv_id":"1802.03569","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-spectral-approach-to-generalization-and","title":"A Spectral Approach to Generalization and Optimization in Neural Networks","date":"2018-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"evaluation-of-generative-networks-through","title":"Evaluation of generative networks through their data augmentation capacity","date":"2018-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"cnns-are-globally-optimal-given-multi-layer","title":"CNNs are Globally Optimal Given Multi-Layer Support","date":"2017-12-07","arxiv_id":"1712.02501","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-frank-wolfe-and-equilibrium-computation","title":"On Frank-Wolfe and Equilibrium Computation","date":"2017-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"state-space-lstm-models-with-particle-mcmc","title":"State Space LSTM Models with Particle MCMC Inference","date":"2017-11-30","arxiv_id":"1711.11179","n_code_links":0,"syntology":null},{"paper":null,"slug":"implicit-regularization-in-nonconvex","title":"Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind Deconvolution","date":"2017-11-28","arxiv_id":"1711.10467","n_code_links":0,"syntology":null},{"paper":null,"slug":"proximal-alternating-direction-network-a","title":"Proximal Alternating Direction Network: A Globally Converged Deep Unrolling Framework","date":"2017-11-21","arxiv_id":"1711.07653","n_code_links":0,"syntology":null},{"paper":"/paper/wasserstein-auto-encoders","slug":"wasserstein-auto-encoders","title":"Wasserstein Auto-Encoders","date":"2017-11-05","arxiv_id":"1711.01558","n_code_links":14,"syntology":{"ran":6,"of":12,"n_ran_checked":2,"n_instrument":4,"unverified":6,"pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 6 unverified","official":{"repos":["tolstikhin/wae"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["listed","official","unlocated"]}}},{"paper":null,"slug":"analysis-of-planar-ornament-patterns-via","title":"Analysis of planar ornament patterns via motif asymmetry assumption and local connections","date":"2017-10-12","arxiv_id":"1710.04623","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-and-strong-convergence-of-online","title":"Fast and Strong Convergence of Online Learning Algorithms","date":"2017-10-10","arxiv_id":"1710.03600","n_code_links":0,"syntology":null},{"paper":null,"slug":"generative-adversarial-mapping-networks","title":"Generative Adversarial Mapping Networks","date":"2017-09-28","arxiv_id":"1709.09820","n_code_links":0,"syntology":null},{"paper":null,"slug":"order-preserving-abstractive-summarization","title":"Order-Preserving Abstractive Summarization for Spoken Content Based on Connectionist Temporal Classification","date":"2017-09-16","arxiv_id":"1709.05475","n_code_links":0,"syntology":null},{"paper":null,"slug":"continuous-time-flows-for-efficient-inference","title":"Continuous-Time Flows for Efficient Inference and Density Estimation","date":"2017-09-04","arxiv_id":"1709.01179","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-vs-diverse-architectures-for","title":"Deep vs. Diverse Architectures for Classification Problems","date":"2017-08-21","arxiv_id":"1708.06347","n_code_links":0,"syntology":null},{"paper":null,"slug":"geometric-enclosing-networks","title":"Geometric Enclosing Networks","date":"2017-08-16","arxiv_id":"1708.04733","n_code_links":0,"syntology":null},{"paper":null,"slug":"follow-the-moving-leader-in-deep-learning","title":"Follow the Moving Leader in Deep Learning","date":"2017-08-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"restricted-eigenvalue-from-stable-rank-with","title":"Restricted Eigenvalue from Stable Rank with Applications to Sparse Linear Regression","date":"2017-07-25","arxiv_id":"1707.08092","n_code_links":0,"syntology":null},{"paper":null,"slug":"big-data-regression-using-tree-based","title":"Big Data Regression Using Tree Based Segmentation","date":"2017-07-24","arxiv_id":"1707.07409","n_code_links":0,"syntology":null},{"paper":null,"slug":"adversarial-examples-uncertainty-and-transfer","title":"Adversarial Examples, Uncertainty, and Transfer Testing Robustness in Gaussian Process Hybrid Deep Networks","date":"2017-07-08","arxiv_id":"1707.02476","n_code_links":0,"syntology":null},{"paper":"/paper/maintaining-cooperation-in-complex-social","slug":"maintaining-cooperation-in-complex-social","title":"Maintaining cooperation in complex social dilemmas using deep reinforcement learning","date":"2017-07-04","arxiv_id":"1707.01068","n_code_links":1,"syntology":null},{"paper":null,"slug":"convergence-analysis-of-two-layer-neural","title":"Convergence Analysis of Two-layer Neural Networks with ReLU Activation","date":"2017-05-28","arxiv_id":"1705.09886","n_code_links":0,"syntology":null},{"paper":"/paper/mutan-multimodal-tucker-fusion-for-visual","slug":"mutan-multimodal-tucker-fusion-for-visual","title":"MUTAN: Multimodal Tucker Fusion for Visual Question Answering","date":"2017-05-18","arxiv_id":"1705.06676","n_code_links":6,"syntology":null},{"paper":null,"slug":"generalized-ideals-and-co-granular-rough-sets","title":"Generalized Ideals and Co-Granular Rough Sets","date":"2017-04-18","arxiv_id":"1704.05477","n_code_links":0,"syntology":null},{"paper":null,"slug":"identification-of-multiword-expressions-for","title":"Identification of Multiword Expressions for Latvian and Lithuanian: Hybrid Approach","date":"2017-04-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"on-architectural-choices-in-deep-learning","title":"On architectural choices in deep learning: From network structure to gradient convergence and parameter estimation","date":"2017-02-28","arxiv_id":"1702.08670","n_code_links":0,"syntology":null},{"paper":null,"slug":"wages-of-wins-could-an-amateur-make-money","title":"Wages of wins: could an amateur make money from match outcome predictions?","date":"2017-02-17","arxiv_id":"1702.05982","n_code_links":0,"syntology":null},{"paper":null,"slug":"bayesian-system-identification-based-on","title":"Bayesian System Identification based on Hierarchical Sparse Bayesian Learning and Gibbs Sampling with Application to Structural Damage Assessment","date":"2017-01-13","arxiv_id":"1701.03550","n_code_links":0,"syntology":null},{"paper":"/paper/saliency-driven-image-manipulation","slug":"saliency-driven-image-manipulation","title":"Saliency Driven Image Manipulation","date":"2016-12-07","arxiv_id":"1612.02184","n_code_links":1,"syntology":null},{"paper":"/paper/improved-variational-inference-with-inverse","slug":"improved-variational-inference-with-inverse","title":"Improved Variational Inference with Inverse Autoregressive Flow","date":"2016-12-01","arxiv_id":null,"n_code_links":2,"syntology":null},{"paper":null,"slug":"vectors-or-graphs-on-differences-of","title":"Vectors or Graphs? On Differences of Representations for Distributional Semantic Models","date":"2016-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"normalizing-flows-on-riemannian-manifolds","title":"Normalizing Flows on Riemannian Manifolds","date":"2016-11-07","arxiv_id":"1611.02304","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimizing-codes-for-source-separation-in","title":"Optimizing Codes for Source Separation in Color Image Demosaicing and Compressive Video Recovery","date":"2016-09-07","arxiv_id":"1609.02135","n_code_links":0,"syntology":null},{"paper":null,"slug":"hybrid-jacobian-and-gauss-seidel-proximal","title":"Hybrid Jacobian and Gauss-Seidel proximal block coordinate update methods for linearly constrained convex programming","date":"2016-08-13","arxiv_id":"1608.03928","n_code_links":0,"syntology":null},{"paper":"/paper/improving-variational-inference-with-inverse","slug":"improving-variational-inference-with-inverse","title":"Improving Variational Inference with Inverse Autoregressive Flow","date":"2016-06-15","arxiv_id":"1606.04934","n_code_links":8,"syntology":{"ran":15,"of":23,"n_ran_checked":14,"n_instrument":1,"unverified":8,"pointer_only":3,"phrase":"15 ran (of which 5 constructed an object rather than computing a result; 14 with no instrument failure: 1 honoured, 1 violated, 12 with no contract checked; 1 where Syntology's instrument failed) · 8 unverified","official":{"repos":["openai/iaf"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":6,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/density-estimation-using-real-nvp","slug":"density-estimation-using-real-nvp","title":"Density estimation using Real NVP","date":"2016-05-27","arxiv_id":"1605.08803","n_code_links":35,"syntology":{"ran":48,"of":70,"n_ran_checked":38,"n_instrument":10,"unverified":22,"pointer_only":33,"phrase":"48 ran (of which 26 constructed an object rather than computing a result; 38 with no instrument failure: 2 honoured, 0 violated, 36 with no contract checked; 10 where Syntology's instrument failed) · 22 unverified","official":null}},{"paper":null,"slug":"interaction-pursuit-in-high-dimensional-multi","title":"Interaction pursuit in high-dimensional multi-response regression via distance correlation","date":"2016-05-11","arxiv_id":"1605.03315","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-constrained-dantzig-selector-with","title":"The constrained Dantzig selector with enhanced consistency","date":"2016-05-11","arxiv_id":"1605.03311","n_code_links":0,"syntology":null},{"paper":null,"slug":"makeup-like-a-superstar-deep-localized-makeup","title":"Makeup like a superstar: Deep Localized Makeup Transfer Network","date":"2016-04-25","arxiv_id":"1604.07102","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-strengthening-of-rational-closure-in-dls","title":"A strengthening of rational closure in DLs: reasoning about multiple aspects","date":"2016-04-01","arxiv_id":"1604.00301","n_code_links":0,"syntology":null},{"paper":"/paper/identity-mappings-in-deep-residual-networks","slug":"identity-mappings-in-deep-residual-networks","title":"Identity Mappings in Deep Residual Networks","date":"2016-03-16","arxiv_id":"1603.05027","n_code_links":54,"syntology":{"ran":14,"of":25,"n_ran_checked":12,"n_instrument":2,"unverified":11,"pointer_only":2,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 0 violated, 11 with no contract checked; 2 where Syntology's instrument failed) · 11 unverified","official":{"repos":["KaimingHe/resnet-1k-layers"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":null,"slug":"universal-dependency-analysis","title":"Universal Dependency Analysis","date":"2015-10-28","arxiv_id":"1510.08389","n_code_links":0,"syntology":null},{"paper":null,"slug":"scalable-bayesian-non-negative-tensor","title":"Scalable Bayesian Non-Negative Tensor Factorization for Massive Count Data","date":"2015-08-18","arxiv_id":"1508.04211","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-map-approach-for-ell_q-norm-regularized","title":"A MAP approach for $\\ell_q$-norm regularized sparse parameter estimation using the EM algorithm","date":"2015-08-05","arxiv_id":"1508.01071","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-svm-like-approach-for-expectile-regression","title":"An SVM-like Approach for Expectile Regression","date":"2015-07-14","arxiv_id":"1507.03887","n_code_links":0,"syntology":null},{"paper":"/paper/supervised-learning-of-semantics-preserving","slug":"supervised-learning-of-semantics-preserving","title":"Supervised Learning of Semantics-Preserving Hash via Deep Convolutional Neural Networks","date":"2015-07-01","arxiv_id":"1507.00101","n_code_links":1,"syntology":null},{"paper":null,"slug":"on-distributive-subalgebras-of-qualitative","title":"On Distributive Subalgebras of Qualitative Spatial and Temporal Calculi","date":"2015-06-01","arxiv_id":"1506.00337","n_code_links":0,"syntology":null},{"paper":"/paper/variational-inference-with-normalizing-flows","slug":"variational-inference-with-normalizing-flows","title":"Variational Inference with Normalizing Flows","date":"2015-05-21","arxiv_id":"1505.05770","n_code_links":17,"syntology":{"ran":21,"of":37,"n_ran_checked":21,"n_instrument":0,"unverified":16,"pointer_only":12,"phrase":"21 ran (of which 13 constructed an object rather than computing a result; 21 with no instrument failure: 1 honoured, 1 violated, 19 with no contract checked; 0 where Syntology's instrument failed) · 16 unverified","official":null}}],"record_sha256":"06dfab3a4ee46093a80c5cd790db88d29564d228454668fecdaf2fb49c7460e8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}