paper-with-me

홈 › Papers

Proofs and additional experiments on Second order techniques for learning time-series with structural breaks

2020-12-15 · Takayuki Osogami

We provide complete proofs of the lemmas about the properties of the regularized loss function that is used in the second order techniques for learning time-series with structural breaks in Osogami (2021). In addition, we show experimental results that support the validity of the techniques.

📄 PDF Abstract BibTeX arXiv:2012.08037

Code (0)

등록된 구현이 없습니다.

Tasks

Time SeriesTime Series Analysis

Similar Papers 제목 키워드 기반

Towards Verifiable AI with Lightweight Cryptographic Proofs of Inference

2026-03-19 · Pranay Anchuri, Matteo Campanelli, Paul Cesaretti, Rosario Gennaro 외 arxiv

When large AI models are deployed as cloud-based services, clients have no guarantee that responses are correct or were produced by the intended model. Rerunning inference locally is infeasible for large models, and exis…

Towards Concise, Machine-discovered Proofs of Gödel's Two Incompleteness Theorems

2020-05-06 · Elijah Malaby, Bradley Dragun, John Licato

There is an increasing interest in applying recent advances in AI to automated reasoning, as it may provide useful heuristics in reasoning over formalisms in first-order, second-order, or even meta-logics. To facilitate …

Automated Theorem ProvingVocal Bursts Valence Prediction

Learning-Assisted Automated Reasoning with Flyspeck

2012-11-29 · Cezary Kaliszyk, Josef Urban

The considerable mathematical knowledge encoded by the Flyspeck project is combined with external automated theorem provers (ATPs) and machine-learning premise selection methods trained on the proofs, producing an AI sys…

CPU

Online Machine Learning Techniques for Coq: A Comparison

2021-04-12 · Liao Zhang, Lasse Blaauwbroek, Bartosz Piotrowski, Prokop Černý 외

We present a comparison of several online machine learning techniques for tactical learning and proving in the Coq proof assistant. This work builds on top of Tactician, a plugin for Coq that learns from proofs written b…

BIG-bench Machine Learning

multiPRover: Generating Multiple Proofs for Improved Interpretability in Rule Reasoning

2021-06-02 · NAACL 2021 4 · Swarnadeep Saha, Prateek Yadav, Mohit Bansal

We focus on a type of linguistic formal reasoning where the goal is to reason over explicit knowledge in the form of natural language facts and rules (Clark et al., 2020). A recent work, named PRover (Saha et al., 2020),…

Multi-Label ClassificationMUlTI-LABEL-ClASSIFICATION