New rules reduce SLOPE model fitting time by screening out irrelevant variables.
problem Expensive tuning of regularization parameter in penalized regression models.
method Strong screening rules for group-based SLOPE models.
result Significant acceleration of fitting process for Group SLOPE and sparse-group SLOPE.
Efficient packages solve SLOPE problem in multiple languages.
problem Efficiently solving SLOPE problem for various data types.
method Hybrid coordinate descent algorithm for GLMs with multiple loss functions.
result Packages outperform existing SLOPE implementations in speed.
This text is the rejoinder following the discussion of a survey paper about minimal penalties and the slope heuristics (Arlot, 2019. Minimal penalties and the slope heuristics: a survey. Journal de la SFDS). While commenting on the remarks made by the discussants, it provides two new results about the slope heuristics …
2-level SLOPE improves high-dimensional inference with fewer hyperparameters.
problem High-dimensional linear regression with complex penalty sequences.
method 2-level SLOPE with three hyperparameters, reducing penalty space.
result Sharp trade-off between TPP and FDP, computationally efficient.
The slope conjecture proposed by Garoufalidis asserts that the Jones slopes given by the sequence of degrees of the colored Jones polynomials are boundary slopes. We verify the slope conjecture for graph knots, i.e. knots whose Gromov volume vanish.
The SLOPE estimates regression coefficients by minimizing a regularized residual sum of squares using a sorted-ℓ1-norm penalty. The SLOPE combines testing and estimation in regression problems. It exhibits suitable variable selection and prediction properties, as well as minimax optimality. This paper introduces …
Solves time-optimal navigation on slippery slopes with cross gravitational wind.
problem Time-optimal navigation on a slippery cross slope under gravitational wind.
method New Finsler metric derived for the problem, considering both lateral and longitudinal gravitational effects.
result Conditions for strong convexity and purely geometric solution provided.
Study slopes in 3-manifolds, proving conjectures about knots.
problem Understanding slopes in 3-manifolds and their implications for knots.
method Upper bounds on distances between slopes, applications to knots and surgeries.
result Bounds on boundary and degeneracy slopes for knots in 3-manifolds.
Paper introduces mcTangent for real-time dynamical systems.
problem Real-time accurate solutions for complex dynamical systems.
method Synergy of tangent slope learning, model-constrained approach, sequential learning, and data randomization.
result Robust and long-time accurate solutions for various equations.
Using the Hatcher-Oertel algorithm for finding boundary slopes of Montesinos knots, we prove the Slope Conjecture and the Strong Slope Conjecture for a family of 3-tangle pretzel knots. More precisely, we prove that the maximal degrees of the colored Jones polynomial of such knots determine a boundary slope as predicte…
Constructs Lefschetz fibrations with slopes near 2.
problem Finding Lefschetz fibrations with slopes close to 2.
method Constructs minimal, simply connected genus-g Lefschetz fibrations over the sphere.
result The infimum and supremum of slopes are not achievable.
Investment strategies derived from commodity futures curves exploit dynamics in price movements.
problem Modeling and predicting the term structure of commodity futures prices.
method Employed the Nelson-Siegel framework to model term structure, and developed investment strategies based on changes in slope and curvature parameters.
result Significant profits generated from systematic strategies based on the change in slope, unrelated to risk factors and robust to transaction costs.
The Slope Conjecture proposed by Garoufalidis asserts that the degree of the colored Jones polynomial determines a boundary slope, and its refinement, the Strong Slope Conjecture proposed by Kalfagianni and Tran asserts that the linear term in the degree determines the topology of an essential surface that satisfies th…
Paper analyzes origami slope gaps and their distribution, finding a unique pattern.
problem Analyzing slope gaps in origami surfaces.
method Derived slope gap distribution of a specific origami by considering return times under the horocycle flow.
result Found a unique distribution of origami slope gaps, not a sum of scaled Hall distributions.
Study provides concrete examples of knot slopes.
problem Finding explicit characterizing slopes for knots.
method Concrete examples for the (-2,3,7)-pretzel knot.
result Explicit characterizing slopes for the knot 12n242. No-arbitrage constraints on implied variance slope are weak, leading to almost guaranteed arbitrage in many cases.
problem Weak constraints on implied variance slope in the Black-Scholes model lead to arbitrage opportunities.
method Analysis of constraints on implied variance slope and their implications for arbitrage.
result Arbitrage is almost always guaranteed in a wide range of slope values where constraints are enforced.
A recently proposed SLOPE estimator (arXiv:1407.3824) has been shown to adaptively achieve the minimax ℓ2 estimation rate under high-dimensional sparse linear regression models (arXiv:1503.08393). Such minimax optimality holds in the regime where the sparsity level k, sample size n, and dimension p satisfy …
Concerning the set of exceptional surgery slopes for a hyperbolic knot, Lackenby and Meyerhoff proved that the maximal cardinality is 10 and the maximal diameter is 8. Their proof is computer-aided in part, and both bounds are achieved simultaneously. In this note, it is observed that the diameter bound 8 implies the m…
A slope p/q is a characterising slope for a knot K in S3 if the oriented homeomorphism type of p/q-surgery on K determines K uniquely. We show that when K is a hyperbolic knot its set of characterising slopes contains all but finitely many slopes p/q with q≥3. We prove stronger results for hyper…
New research shows that many slopes are characterizing for satellite knots.
problem Characterizing slopes for satellite knots.
method Detailed examination of the JSJ decomposition of a surgery along a knot, combined with other authors' constraints on surgery slopes.
result Many non-integral slopes are characterizing for composite knots.
The Slope Conjecture relates the degree of the colored Jones polynomial to the boundary slopes of a knot. We verify the Slope Conjecture and the Strong Slope Conjecture for Montesinos knots M(r1,s−u11,t1) with r,u,t odd, s even and u≤−1, r<−1<1<s,t.
New slopes identified for torus knots, improving previous results.
problem Identifying characterizing slopes for torus knots.
method Applying recent work on L-space surgeries, improving previous bounds.
result Every nontrivial L-space slope of T5,2 is characterizing for T5,2. A non-trivial slope r on a knot K in S3 is called a characterizing slope if whenever the result of r-surgery on a knot K′ is orientation preservingly homeomorphic to the result of r-surgery on K, then K′ is isotopic to K. Ni and Zhang ask: for any hyperbolic knot K, is a slope r=p/q with $|p| +…
Solves time-minimizing navigation on a mountain slope using Riemann-Finsler geometry.
problem Time-minimizing navigation on a mountain slope under gravity.
method Riemann-Finsler geometry, Zermelo navigation problem, anisotropic deformation of the background Riemannian metric, rescaled gravitational wind.
result A new Finsler metric for optimal navigation on slippery mountain slopes.
New knots found with specific slope properties.
problem Finding knots with non-integral boundary slopes.
method Kabaya's method for boundary slopes and layered solid torus construction.
result Existence of knots with boundary slopes of any positive denominator.
Safe screening rule improves Group SLOPE efficiency.
problem Efficiently selecting groups of predictors in high-dimensional sparse learning.
method Safe screening rule for Group SLOPE, addressing block non-separable group effects.
result Significant computational efficiency gains without sacrificing accuracy.
Let X be a norm curve in the SL(2,C)-character variety of a knot exterior M. Let t = || b || / || a || be the ratio of the Culler-Shalen norms of two distinct non-zero classes a, b in H_1(\partial M, Z). We demonstrate that either X has exactly two associated strict boundary slopes \pm t, or else there are strict bound…
The (Strong) Slope Conjecture relates the degree of the colored Jones polynomial of a knot to certain essential surfaces in the knot complement. We verify the Slope Conjecture and the Strong Slope Conjecture for 3-string Montesinos knots satisfying certain conditions.
Let r_m and r_M be the least and greatest finite boundary slopes of a hyperbolic knot K in S^3. We show that any cyclic surgery slopes of K must lie in the interval (r_m - 1/2, r_M + 1/2).
A new model predicts wildfire spread with wind and slope effects.
problem Predicting wildfire spread with wind and slope effects.
method Geometric model based on Lorentz-Finsler framework, considering wind and slope.
result Infinitesimal wavefronts are no longer restricted to be elliptical, allowing for more accurate predictions.
Study Mazur doubles of knots and their relation to the Slope Conjecture.
problem Proving the Strong Slope Conjecture for Mazur doubles of knots.
method Analyzing Mazur doubles under certain hypotheses and using the Slope Conjecture.
result Mazur doubles of knots satisfy the Strong Slope Conjecture under certain conditions.
The study confirms conjectures about slopes of knots using knot Floer homology.
problem Verifying conjectures about non-integer characterizing slopes of knots.
method Using knot Floer homology, the study verifies conjectures for specific classes of knots.
result Almost all slopes are characterizing for many knots, and infinitely many for L-space knots. Proves existence of Lefschetz fibrations with arbitrary slopes.
problem Finding Lefschetz fibrations with specific slopes.
method Proves existence for rational numbers in (2,8) with large genus.
result Arbitrary slopes (r in (2,8)) are possible for genus-g Lefschetz fibrations.
The paper examines slopes and their norms in exceptional Dehn fillings.
problem Understanding slopes and norms in exceptional Dehn fillings.
method Investigates the relationship between Euclidean length and Culler-Shalen norm on horotori.
result Establishes two inequalities between Euclidean length and Culler-Shalen norm.
Neural networks' slope controls their generalization.
problem Controlling overfitting in neural networks.
method Control the slope of neural networks to avoid memorization.
result The slope of a well-trained neural network is generally independent of network width and architecture.
This paper completes proofs for left orderable slopes of double twist knots.
problem Proving the left orderability of slopes for double twist knots.
method Continuous families of hyperbolic SL2(R) representations of knot groups.
result Any slope in (-4n, 4m) is a left orderable slope of C(2m+1, -2n).
A slope qp is called a characterizing slope for a given knot K0 in S3 if whenever the qp-surgery on a knot K in S3 is homeomorphic to the qp-surgery on K0 via an orientation preserving homeomorphism, then K=K0. In this paper we try to find characterizing slopes for torus knots $…
Nested model averaging improves high-dimensional linear regression performance.
problem High-dimensional linear regression with predictor ordering impact.
method Combining model averaging with regularized estimators on the solution path.
result Nested model averaging with lasso and SLOPE outperforms competing methods.
Formula found for energy slope in complex geometry.
problem Calculating the asymptotic slope of a K-energy.
method Established a formula for the asymptotic slope.
result Found a formula for the asymptotic slope of α-K-energy.
No characterizing slopes for multi-component links.
problem No characterizing slopes for multi-component links.
method Demonstrated through infinitely many examples of non-homeomorphic complements.
result Infinitely many links with non-homeomorphic complements.
SLOPE is a relatively new convex optimization procedure for high-dimensional linear regression via the sorted l1 penalty: the larger the rank of the fitted coefficient, the larger the penalty. This non-separable penalty renders many existing techniques invalid or inconclusive in analyzing the SLOPE solution. In this pa…
We describe an algorithm for computing boundary slopes of 2-bridge links. As an example, we work out the slopes of the links obtained by 1/k surgery on one component of the Borromean rings. A table of all boundary slopes of all 2-bridge links with 10 or less crossings is also included.
A new fast algorithm solves SLOPE optimization problem.
problem Inefficient algorithms for SLOPE optimization in high dimensions.
method Combines proximal gradient descent and proximal coordinate descent steps.
result Our method outperforms competing algorithms in benchmarks.
The slope invariant is shown to be unchanged by concordance of colored links.
problem Describing the concordance of colored links with a distinguished component.
method Proved the slope invariant is invariant under concordance using C-complexes and generalized Seifert forms.
result The slope invariant is invariant under concordance of links.
The geometry on a slope of a mountain is the geometry of a Finsler metric, called here the {\it slope metric}. We study the existence of globally defined slope metrics on surfaces of revolution as well as the geodesic's behavior. A comparison between Finslerian and Riemannian areas of a bounded region is also studied.
Certain torus knots have infinitely many slopes that do not uniquely identify them.
problem Identifying non-characterizing slopes for certain torus knots.
method Applying a condition from Baker and Motegi to show infinitely many non-characterizing slopes.
result The knots T2,2n+3#T−2,2n+1 have infinitely many non-characterizing slopes. 3-manifolds with similar completions have matching slopes and polynomials.
problem Matching slopes and polynomials in cusped hyperbolic 3-manifolds.
method Prove similarity of profinite completions leads to matching A-polynomials and boundary slopes. result Strongly detected boundary slopes match between manifolds with similar completions.
The Slope Conjecture relates the degree of the colored Jones polynomial of a knot to boundary slopes of incompressible surfaces. Our aim is to prove the Slope Conjecture for Montesinos knots, and to match parameters of a state-formula for the colored Jones polynomial of such knots with the parameters that describe thei…