← Search

Norihito Yasuda

7 accepted papers

2025

An And-Sum Circuit with Signed Edges That Is More Succinct than SDD

AAAI 2025technical

Knowledge compilation is a method of transforming knowledge into a compressed and tractable form for permitting more efficient operations. For Boolean functions, numerous representations have been proposed that enhance succinctness and tractability. In this paper, we introduce a new representation n…

Cited by 0SourcePDFScholar
2025

Tensor Decomposition Meets Knowledge Compilation: A Study Comparing Tensor Trains with OBDDs

AAAI 2025technical

A knowledge compilation map analyzes tractable operations in Boolean function representations and compares their succinctness. This enables the selection of appropriate representations for different applications. In the knowledge compilation map, all representation classes are subsets of the negatio…

Cited by 0SourcePDFScholar
2024

JaParaPat: A Large-Scale Japanese-English Parallel Patent Application Corpus

COLING 2024main

We constructed JaParaPat (Japanese-English Parallel Patent Application Corpus), a bilingual corpus of more than 300 million Japanese-English sentence pairs from patent applications published in Japan and the United States from 2000 to 2021. We obtained the publication of unexamined patent applicatio…

Cited by 2SourcePDFScholar
2024

Understanding the Impact of Introducing Constraints at Inference Time on Generalization Error

ICML 2024poster

Since machine learning technologies are being used in various practical situations, models with merely low prediction errors might not be satisfactory; prediction errors occurring with a low probability might yield dangerous results in some applications. Therefore, there are attempts to achieve an M…

Cited by 1SourcePDFScholar
2022

Generalization Analysis on Learning with a Concurrent Verifier

NeurIPS 2022accept

Machine learning technologies have been used in a wide range of practical systems. In practical situations, it is natural to expect the input-output pairs of a machine learning model to satisfy some requirements. However, it is difficult to obtain a model that satisfies requirements by just learning…

Cited by 2SourcePDFScholar
2021

Compressing Exact Cover Problems with Zero-suppressed Binary Decision Diagrams

IJCAI 2021poster

Exact cover refers to the problem of finding subfamily F of a given family of sets S whose universe is D, where F forms a partition of D. Knuth’s Algorithm DLX is a state-of-the-art method for solving exact cover problems. Since DLX’s running time depends on the cardinality of input S, it can b…