Results 31 to 40 of about 106,354 (248)
Oracle inequalities for weighted group lasso in high-dimensional misspecified Cox models
We study the nonasymptotic properties of a general norm penalized estimator, which include Lasso, weighted Lasso, and group Lasso as special cases, for sparse high-dimensional misspecified Cox models with time-dependent covariates.
Yijun Xiao +3 more
doaj +1 more source
Quantum query complexity of symmetric oracle problems [PDF]
We study the query complexity of quantum learning problems in which the oracles form a group $G$ of unitary matrices. In the simplest case, one wishes to identify the oracle, and we find a description of the optimal success probability of a $t$-query ...
Daniel Copeland, Jamie Pommersheim
doaj +1 more source
An Oracle Approach for Interaction Neighborhood Estimation in Random Fields [PDF]
We consider the problem of interaction neighborhood estimation from the partial observation of a finite number of realizations of a random field.
Lerasle, Matthieu +1 more
core +2 more sources
An ID-Based Linearly Homomorphic Signature Scheme and Its Application in Blockchain
Identity-based cryptosystems mean that public keys can be directly derived from user identifiers, such as telephone numbers, email addresses, and social insurance number, and so on.
Qun Lin +5 more
doaj +1 more source
Delegating Quantum Computation in the Quantum Random Oracle Model
A delegation scheme allows a computationally weak client to use a server's resources to help it evaluate a complex circuit without leaking any information about the input (other than its length) to the server.
A Broadbent +17 more
core +1 more source
Slope heuristics and V-Fold model selection in heteroscedastic regression using strongly localized bases [PDF]
We investigate the optimality for model selection of the so-called slope heuristics, $V$-fold cross-validation and $V$-fold penalization in a heteroscedastic with random design regression context.
Navarro, Fabien, Saumard, Adrien
core +4 more sources
ID-based transitive signature schemes without random oracle
Based on waters’ signature scheme,the first identity-based transitive signature scheme was proposed and proved secure against attacks in the standard model.Compared with current transitive signature schemes,the unforgeability of the signature’s ...
MA Xiao-long1 +4 more
doaj +2 more sources
Discrete choice, permutations, and reconstruction [PDF]
In this paper we study the well-known family of Random Utility Models, developed over 50 years ago to codify rational user behavior in choosing one item from a finite set of options. In this setting each user draws i.i.d. from some distribution a utility
Chierichetti, Flavio +2 more
core +1 more source
Customizing Tactile Sensors via Machine Learning‐Driven Inverse Design
ABSTRACT Replicating the sophisticated sense of touch in artificial systems requires tactile sensors with precisely tailored properties. However, manually navigating the complex microstructure‐property relationship results in inefficient and suboptimal designs.
Baocheng Wang +15 more
wiley +1 more source
Certificateless signature scheme without random oracles
The security of certificateless signature schemes can be proved under the random oracle model.However,any implementation of the random oracle may result in insecure schemes.Some certificateless signature schemes without random oracles are not secure ...
Yan-qiong LI, Ji-guo LI, Yi-chen ZHANG
doaj +2 more sources

