搜索结果: 1-15 共查到“descent”相关记录61条 . 查询时间(0.093 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Long-time asymptotics of soliton equations via the nonlinear steepest descent method
非线性 最速下降法 孤立子方程 长时间渐近性
2023/11/13
Based on the matrix block technique, the Deift-Zhou nonlinear steepest descent method is developed in order to study the asymptotic analysis of solutions of some nonlinear evolution equations associat...
A new perspective on the powers of two descent for discrete logarithms in finite fields
foundations discrete logarithm problem
2018/7/9
A new proof is given for the correctness of the powers of two descent method for computing discrete logarithms. The result is slightly stronger than the original work, but more importantly we provide ...
Metabolic responses to a traditional Mexican diet compared with a commonly consumed US diet in women of Mexican descent: a randomized crossover feeding trial
inflammatory responses insulin sensitivity metabolic responses Mexican diet US diet
2018/11/27
Background: Mexican immigrants are disproportionally affected by diet-related risk of metabolic dysfunction. Whether adhering to a traditional Mexican diet or adopting a US diet contributes to metabol...
Last fall degree, HFE, and Weil descent attacks on ECDLP
ECDLP Weil descent solving equations
2015/12/29
Weil descent methods have recently been applied to attack
the Hidden Field Equation (HFE) public key systems and solve the elliptic
curve discrete logarithm problem (ECDLP) in small characteristic.
...
Regularization Paths for Cox’s Proportional Hazards Model via Coordinate Descent
survival Cox model lasso elastic net
2015/8/21
We introduce a pathwise algorithm for the Cox proportional hazards model, regularized by convex combinations of `1 and `2 penalties (elastic net). Our algorithm fits via cyclical coordinate descent, a...
SparseNet:Coordinate Descent with Non-Convex Penalties
Sparse Regression Regularization Surface Non-convex Optimization Coordinate Descent Degrees of Freedom Variable Selection LASSO
2015/8/21
We address the problem of sparse selection in linear models. A number of non-convex penalties have been proposed in the literature for this purpose, along with a variety of convex-relaxation algorithm...
A Blockwise Descent Algorithm for Group-penalized Multiresponse and Multinomial Regression
Blockwise Descent Algorithm Group-penalized Multiresponse Multinomial Regression
2015/8/21
In this paper we purpose a blockwise descent algorithm for grouppenalized multiresponse regression. Using a quasi-newton framework we extend this to group-penalized multinomial regression. We give a p...
THE PEAK ALGEBRA AND THE DESCENT ALGEBRAS OF TYPES B AND D
peak algebra signed permutations Coxeter groups
2015/8/14
We show the existence of a unital subalgebra Pn of the symmetric group
algebra linearly spanned by sums of permutations with a common peak set, which we
call the peak algebra. We show that Pn is the...
Structured Stable Homotopy Theory and the Descent Problem for the Algebraic K-theory of Fields
Structured Stable Homotopy Theory Algebraic K-theory
2015/7/7
his is a relative result which asserts that the K-theory spectra of any two
algebraically closed fields of a given characteristic are equivalent to each other
after completion at a prime not e...
In the theory of schemes, faithfully
at descent is a very powerful tool. One wants a descent theory
not only for quasi-coherent sheaves and morphisms of schemes (which is rather elementary), but al...
Equations System coming from Weil descent and subexponential attack for algebraic curve cryptosystem
ECDLP first fall degree
2014/3/10
Faug\'ere et al. shows that the decomposition problem of a point of elliptic curve over binary field $F_{2^n}$ reduces to solving low degree equations system over $F_2$ coming from Weil descent. Using...
Solving the Elliptic Curve Discrete Logarithm Problem Using Semaev Polynomials, Weil Descent and Gr鯾ner Basis Methods -- an Experimental Study
public-key cryptography Elliptic curve discrete logarithm problem
2014/3/8
At ASIACRYPT 2012, Petit and Quisquater suggested that there may be a subexponential-time index-calculus type algorithm for the Elliptic Curve Discrete Logarithm Problem (ECDLP) in characteristic two ...
A Method For Generation Of High-Nonlinear S-Boxes Based On Gradient Descent
nonlinearity symmetric ciphers
2014/3/10
Criteria based on the analysis of the properties of vectorial Boolean functions for selection of substitutions (S-boxes) for symmetric cryptographic primitives are given. We propose an improved gradie...
On the Complexity Analysis of Randomized Block-Coordinate Descent Methods
Randomized block-coordinate descent accelerated coordinate descent iteration complexity convergence rate composite minimization
2013/6/17
In this paper we analyze the randomized block-coordinate descent (RBCD) methods proposed in [8,11] for minimizing the sum of a smooth convex function and a block-separable convex function. In particul...
Adaptivity of averaged stochastic gradient descent to local strong convexity for logistic regression
Adaptivity averaged stochastic gradient descent local strong convexity logistic regression
2013/4/28
In this paper, we consider supervised learning problems such as logistic regression and study the stochastic gradient method with averaging, in the usual stochastic approximation setting where observa...