scispace - formally typeset
Search or ask a question
Topic

Product (mathematics)

About: Product (mathematics) is a research topic. Over the lifetime, 44382 publications have been published within this topic receiving 377809 citations.


Papers
More filters
Proceedings Article
29 Jul 2017
TL;DR: In this paper, a PAC-Bayes analysis is used to derive a generalization bound for feedforward neural networks in terms of the product of the spectral norm of the layers and the Frobenius norm of weights.
Abstract: We present a generalization bound for feedforward neural networks in terms of the product of the spectral norm of the layers and the Frobenius norm of the weights. The generalization bound is derived using a PAC-Bayes analysis.

383 citations

Journal ArticleDOI
TL;DR: The theory in connection with incomplete product sets is demonstrated with priority orderings and assignments and an additivity axiom leads to an additive utility representation for the elements in X.
Abstract: A previous paper discusses the notion of additive utilities in the expected-utility context when the set of consequences X can be written as the product of n other sets: X = X1 × X2 × ⋯ × Xn. The present paper continues this investigation for cases where X is a subset of the product of n other sets: X ⊂ X1 × X2 × ⋯ × Xn. Under a finiteness restriction, an additivity axiom leads to an additive utility representation for the elements in X. The potential usefulness of the theory in connection with incomplete product sets is demonstrated with priority orderings and assignments.

380 citations

Journal ArticleDOI
TL;DR: In this paper, sufficient and sufficient conditions for weak convergence of the maxima are given for extremal processes generated by multivariate DF's and conditions for the limit joint DF to be a product of marginal DF's.
Abstract: Let $$\{ (X_n^{(1)} ),...,X_n^{(k)} ,{\text{ }}n\} \underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{ \geqslant } 1\} $$ be k-dimensional iid random vectors. Necessary and sufficient conditions are found for the weak convergence of the maxima $$\left\{ {\mathop {\text{V}}\limits_{j{\text{ = 1}}}^n X_j^{(1)} ,...,\mathop {\text{V}}\limits_{j{\text{ = 1}}}^n X_j^{(k)} } \right\}$$ suitably normed to a non-degenerate limit df. The class of such limits is specified and conditions stated for the limit joint df to be a product of marginal df's. Some results are presented concerning extremal processes generated by multivariate df's.

380 citations

Journal ArticleDOI
TL;DR: Left-invariant metrics are defined on the product G × I thus allowing the generation of transformations of the background geometry as well as the image values, and structural generation in which image values are changed supporting notions such as tissue creation in carrying one image to another.
Abstract: This paper constructs metrics on the space of images {\cal I} defined as orbits under group actions {\cal G}. The groups studied include the finite dimensional matrix groups and their products, as well as the infinite dimensional diffeomorphisms examined in Trouve (1999, Quaterly of Applied Math.) and Dupuis et al. (1998). Quaterly of Applied Math.). Left-invariant metrics are defined on the product {\cal G} \times {\cal I} thus allowing the generation of transformations of the background geometry as well as the image values. Examples of the application of such metrics are presented for rigid object matching with and without signature variation, curves and volume matching, and structural generation in which image values are changed supporting notions such as tissue creation in carrying one image to another.

379 citations

Posted Content
TL;DR: A non-commutative theory of symmetric functions, based on the notion of quasi-determinant, was presented in this article, which allows to endow the resulting algebra with a Hopf structure, which leads to a new method for computing in descent algebras.
Abstract: This paper presents a noncommutative theory of symmetric functions, based on the notion of quasi-determinant. We begin with a formal theory, corresponding to the case of symmetric functions in an infinite number of independent variables. This allows us to endow the resulting algebra with a Hopf structure, which leads to a new method for computing in descent algebras. It also gives unified reinterpretation of a number of classical constructions. Next, we study the noncommutative analogs of symmetric polynomials. One arrives at different constructions, according to the particular kind of application under consideration. For example, when a polynomial with noncommutative coefficients in one central variable is decomposed as a product of linear factors, the roots of these factors differ from those of the expanded polynomial. Thus, according to whether one is interested in the construction of a polynomial with given roots or in the expansion of a product of linear factors, one has to consider two distinct specializations of the formal symmetric functions. A third type appears when one looks for a noncommutative generalization of applications related to the notion of characteristic polynomial of a matrix. This construction can be applied, for instance, to the noncommutative matrices formed by the generators of the universal enveloping algebra $U(gl_n)$ or of

376 citations


Network Information
Related Topics (5)
Indifference graph
10.8K papers, 287.9K citations
69% related
Vertex (geometry)
18.7K papers, 294.2K citations
68% related
Pathwidth
8.3K papers, 252.2K citations
68% related
Polynomial
52.6K papers, 853.1K citations
68% related
Analytic function
11.5K papers, 183.9K citations
67% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20251
20244
20239,015
202219,171
20212,013
20202,263