Sciweavers

64 search results - page 3 / 13
» On the Proof Complexity of Deep Inference
Sort
View
TLCA
2009
Springer
13 years 11 months ago
Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic
Abstract. We investigate the question of what constitutes a proof when quantifiers and multiplicative units are both present. On the technical level this paper provides two new as...
Lutz Straßburger
BICA
2010
13 years 9 days ago
Application Feedback in Guiding a Deep-Layered Perception Model
Deep-layer machine learning architectures continue to emerge as a promising biologically-inspired framework for achieving scalable perception in artificial agents. State inference ...
Itamar Arel, Shay Berant
ICML
2008
IEEE
14 years 6 months ago
On the quantitative analysis of deep belief networks
Deep Belief Networks (DBN's) are generative models that contain many layers of hidden variables. Efficient greedy algorithms for learning and approximate inference have allow...
Ruslan Salakhutdinov, Iain Murray
CORR
2012
Springer
214views Education» more  CORR 2012»
12 years 1 months ago
Sum-Product Networks: A New Deep Architecture
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
Hoifung Poon, Pedro Domingos
RTA
2010
Springer
13 years 9 months ago
Modular Complexity Analysis via Relative Complexity
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
Harald Zankl, Martin Korp