paper-with-me

Papers

Improving Unsupervised Visual Program Inference with Code Rewriting Families

2023-09-26 · ICCV 2023 1 · Aditya Ganeshan, R. Kenny Jones, Daniel Ritchie

Programs offer compactness and structure that makes them an attractive representation for visual data. We explore how code rewriting can be used to improve systems for inferring programs from visual data. We first propose Sparse Intermittent Rewrite Injection (SIRI), a framework for unsupervised bootstrapped learning. SIRI sparsely applies code rewrite operations over a dataset of training programs, injecting the improved programs back into the training set. We design a family of rewriters for visual programming domains: parameter optimization, code pruning, and code grafting. For three shape programming languages in 2D and 3D, we show that using SIRI with our family of rewriters improves performance: better reconstructions and faster convergence rates, compared with bootstrapped learning methods that do not use rewriters or use them naively. Finally, we demonstrate that our family of rewriters can be effectively used at test time to improve the output of SIRI predictions. For 2D and 3D CSG, we outperform or match the reconstruction performance of recent domain-specific neural architectures, while producing more parsimonious programs that use significantly fewer primitives.

📄 PDF Abstract BibTeX arXiv:2309.14972

Code (1)

BardOfCodes/coref 공식 구현 pytorch

Similar Papers 제목 키워드 기반

A Machine Learning guided Rewriting Approach for ASP Logic Programs

2020-09-22 · Elena Mastria, Jessica Zangari, Simona Perri, Francesco Calimeri

Answer Set Programming (ASP) is a declarative logic formalism that allows to encode computational problems via logic programs. Despite the declarative nature of the formalism, some advanced expertise is required, in gene…

BIG-bench Machine Learning

System Predictor: Grounding Size Estimator for Logic Programs under Answer Set Semantics

2023-03-29 · Daniel Bresnahan, Nicholas Hippen, Yuliya Lierler

Answer set programming is a declarative logic programming paradigm geared towards solving difficult combinatorial search problems. While different logic programs can encode the same problem, their performance may vary si…

Unsupervised Discontinuous Constituency Parsing with Mildly Context-Sensitive Grammars

2022-12-18 · Songlin Yang, Roger P. Levy, Yoon Kim

We study grammar induction with mildly context-sensitive grammars for unsupervised discontinuous parsing. Using the probabilistic linear context-free rewriting system (LCFRS) formalism, our approach fixes the rule struct…

Constituency Parsingparameter estimationTensor Decomposition

Can Open Domain Question Answering Systems Answer Visual Knowledge Questions?

2022-02-09 · Jiawen Zhang, Abhijit Mishra, Avinesh P. V. S, Siddharth Patwardhan 외

The task of Outside Knowledge Visual Question Answering (OKVQA) requires an automatic system to answer natural language questions about pictures and images using external knowledge. We observe that many visual questions,…

Open-Domain Question AnsweringQuestion AnsweringQuestion RewritingVisual Question Answering+1

Computing Horn Rewritings of Description Logics Ontologies

2015-04-20 · Mark Kaminski, Bernardo Cuenca Grau

We study the problem of rewriting an ontology O1 expressed in a DL L1 into an ontology O2 in a Horn DL L2 such that O1 and O2 are equisatisfiable when extended with an arbitrary dataset. Ontologies that admit such rewrit…