PAGE optimizes nonconvex problems with optimal convergence rates.
problem Nonconvex optimization problems.
method PAGE algorithm for achieving optimal convergence rates.
result PAGE achieves optimal convergence rates for nonconvex optimization.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
48 results for “PAGE algorithm”
Optimizes web page freshness with limited crawling frequencies.
problem Maximize local cache freshness given crawling frequency constraints.
method Three novel online estimation schemes for page change rates.
result Convergent algorithms for estimating page change rates.
A new bandit algorithm for web page item display.
problem Optimizing item display at specific positions on a web page.
method Position-based multiple-play bandits with Thompson sampling.
result Delivers better recommendations with less prior information.
Optimization is commonly employed to determine the content of web pages, such as to maximize conversions on landing pages or click-through rates on search engine result pages. Often the layout of these pages can be decoupled into several separate decisions. For example, the composition of a landing page may involve dec…
Algorithm constructs Kirby diagrams for 4D open books.
problem Constructing Kirby diagrams for 4D open books.
method Algorithm using Heegaard diagrams of pages.
result Diffeomorphic open books constructed with different pages and monodromies.
Scalable web crawling using noisy change-indicating signals.
problem Optimizing web page freshness with limited bandwidth and noisy side information.
method Proposes a scalable crawling algorithm that uses noisy side information optimally.
result Achieves constant total rate of crawling without spikes in bandwidth usage.
A search engine recommends to the user a list of web pages. The user examines this list, from the first page to the last, and clicks on all attractive pages until the user is satisfied. This behavior of the user can be described by the dependent click model (DCM). We propose DCM bandits, an online learning variant of t…
Alternative proof of Dynnikov's three-page index for torus links.
problem Proving the existence of a three-page presentation for any link.
method Provided an alternative proof and defined the three-page index.
result Determined exact three-page indices for several torus links.
A search engine usually outputs a list of web pages. The user examines this list, from the first web page to the last, and chooses the first attractive page. This model of user behavior is known as the cascade model. In this paper, we propose cascading bandits, a learning variant of the cascade model where the obje…
Freya PAGE optimizes nonconvex optimization with heterogeneous, asynchronous workers.
problem Optimizing nonconvex finite-sum problems with varying worker processing times.
method Freya PAGE, a parallel method robust to stragglers and adaptive to slow computations.
result Freya PAGE offers improved time complexity guarantees compared to previous methods.
Model predicts web page parallelism for improved browser performance and energy.
problem Improving browser performance and energy usage through parallelism.
method Supervised learning model using web page primitives and parallelism features.
result Model predicts parallelism and optimizes performance and energy usage.
The paper refines the three-page index for links, proving a new bound and characterizing specific links.
problem Investigating the three-page index invariant for links and proving bounds.
method Constructing three-page presentations from reduced link diagrams via binding circles and contractible subcomplexes.
result Proves a new bound for the three-page index and characterizes links achieving equality.
Study the spectrum of Page's metric on complex projective spaces.
problem Solving the spectrum of the Laplacian on Page's inhomogeneous metric.
method Numerical construction and perturbative analysis based on isometries and pseudospectral methods.
result Numerically constructed spectrum of the Laplacian and Lichnerowicz Laplacian.
We construct a series of finitely presented semigroups. The centers of these semigroups encode uniquely up to rigid ambient isotopy in 3-space all non-oriented spatial graphs. This encoding is obtained by using three-page embeddings of graphs into the product of the line with the cone on three points. By exploiting thr…
Extracts main content from web pages using neural sequence labeling.
problem Lack of generalization in existing web page content extraction models.
method Neural sequence labeling model using HTML tags and words as input.
result Model outperforms state-of-the-art and adapts to changes in web page structure.
Extends deformation theory to higher-page analogues of manifolds.
problem Deformation theory of higher-page analogues of manifolds.
method Extends essential deformations from Iwasawa manifolds to page-1-∂∂-manifolds.
result Obtains an unobstructedness theorem for page-1-∂∂-manifolds.
Improved linear upper bound for ribbonlength of knots.
problem Estimating the ribbonlength of knots and links.
method Using four-page open book decompositions and spanning trees of checkerboard graphs, constructing a four-page presentation with at most 2c(K) arcs.
result Proved that ribbonlength is bounded above by the four-page index, leading to the linear bound Rib(K) ≤ 2c(K).
PAGE is a simple gradient estimator for nonconvex optimization problems.
problem Nonconvex optimization problems in machine learning.
method PAGE is a probabilistic gradient estimator that uses vanilla SGD with probability and a small adjustment with probability 1-p.
result PAGE achieves optimal convergence rates for nonconvex finite-sum and online problems.
New invariant distinguishes Legendrian surfaces in 5-manifolds.
problem Distinguishing Legendrian surfaces in closed contact 5-manifolds.
method Introduced a new Legendrian isotopy invariant, , and extended it to an absolute invariant.
result New invariant distinguishes surfaces not distinguishable by Thurston-Bennequin invariant.
The spectral sequence's -page is a link invariant for .
problem Proving the invariance of the spectral sequence pages.
method Analyzing the spectral sequence construction and its properties.
result The -page is a link invariant for .
We construct a contact 5-manifold supported by infinitely many distinct open books with the identity monodromy and pairwise exotic Stein pages (i.e. pages are pairwise homeomorphic but non-diffeomorphic Stein fillings of a fixed contact 3-manifold), moreover we describe a process of generating infinitely many such exam…
In this paper, we study some classes of submanifolds of codimension one and two in the Page space. These submanifolds are totally geodesic. We also compute their curvature and show that some of them are constant curvature spaces. Finally we give information on how the Page space is related to some other metrics on the …
A simple algorithm for Gaussian mean testing with optimal sample complexity.
problem Distinguishing between standard Gaussian and other Gaussian distributions with unknown mean and covariance.
method An extremely simple algorithm with a one-page analysis.
result Optimal sample complexity of Θ(√d/ε^2) with sample linear time.
Generative models predict page quality without training, useful for low-resource settings.
problem Detecting low-quality content in web articles.
method Human evaluation and analysis of 500 million web articles.
result Generative models can predict page quality without training, useful for low-resource settings.
The paper extends Hawking--Page solutions to various spacetimes with singularities.
problem Understanding the extensions of Hawking--Page solutions with different types of singularities.
method Kaluza--Klein reduction and Christodoulou's methods.
result Extensions of Lorentzian Hawking--Page solutions with null, spacelike singularities, and Cauchy horizons of Taub--NUT type are proven.
Algorithm converts curves on ribbon surfaces to contact surgery diagrams.
problem Legendrian realization of curves on ribbon surfaces.
method Explicit algorithm to Legendrian realize homologically nontrivial curves.
result Any two Legendrian realizations of the same curve are Legendrian isotopic.
TailedTS: Benchmark Dataset for Heavy-Tailed Time Series Prediction and Periodicity Quantificationcs.LG
TailedTS dataset benchmarks heavy-tailed time series forecasting and periodicity quantification.
problem Benchmarking robustness of time series models under heavy-tailed distributions.
method Derived from Wikipedia page views, introduces periodicity quantification and robust loss functions.
result Standard Gaussian models degrade on high-volume page categories, while robust alternatives perform consistently.
Open books and plumbingsmath.GT
We construct, somewhat non-standard, Legendrian surgery diagrams for some Stein fillable contact structures on some plumbing trees of circle bundles over spheres. We then show how to put such a surgery diagram on the pages of an open book for with relatively low genus. Thus we produce open books with low genus p…
In this note, we define a new invariant of a Legendrian knot in a contact manifold using an open book decomposition supporting the contact structure. We define the support genus sg(L) of a Legendrian knot L in a contact 3-manifold (M, ξ) as the minimal genus of a page of an open book of M supporting the contact structu…
In this note we define three invariants of contact structures in terms of open books supporting the contact structures. These invariants are the support genus (which is the minimal genus of a page of a supporting open book for the contact structure), the binding number (which is the minimal number of binding components…
New non-Kähler manifolds constructed with specific properties.
problem Creating non-Kähler manifolds with cohomological properties.
method Four constructions using quotient singularities and spectral sequences.
result Disproved a conjecture by Popovici.
Study homotopy groups of open books and their pages, pages, and bindings.
problem Homotopy groups of open books and their components.
method Homotopy theoretic conditions on monodromy, integral and rational loop space decompositions.
result Integral and rational loop space decompositions for open books under specific conditions.
Given any closed, connected, orientable --manifold and integers , we show the existence of knots in whose genus bridge number is greater than . These knots lie in a page of an open book decomposition of , and the proof proceeds by examining the action of the map induced by the monodr…
A new MDP with Bandits approach for sequential decision making in linear-flow scenarios.
problem Sequential decision making with limited feedback in a linear-flow context.
method Formulated as an MDP with Bandits, using Thompson sampling for action selection and exact dynamic programming for allocation.
result The proposed MDP with Bandits algorithm outperforms other methods in sequential decision making.
The project aims to research on combining deep learning specifically Long-Short Memory (LSTM) and basic statistics in multiple multistep time series prediction. LSTM can dive into all the pages and learn the general trends of variation in a large scope, while the well selected medians for each page can keep the special…
The contents of this 98-page paper have been subsumed into the 191-page paper "A colored sl(N)-homology for links in S^3" (arXiv:0907.0695v1 [math.GT]), in which we further develop the theory and use it to construct a colored link homology.
We give explicit formulas and algorithms for the computation of the Thurston-Bennequin invariant of a nullhomologous Legendrian knot on a page of a contact open book and on contact Heegaard surfaces. Furthermore, we extend the results to rationally nullhomologous knots in arbitrary 3-manifolds.
Research on social-media platforms has tended to rely on textual analysis to perform research tasks. While text-based approaches have significantly increased our understanding of online behavior and social dynamics, they overlook features on these platforms that have grown in prominence in the past few years: click-bas…
Recently, the development and implementation of phishing attacks require little technical skills and costs. This uprising has led to an ever-growing number of phishing attacks on the World Wide Web. Consequently, proactive techniques to fight phishing attacks have become extremely necessary. In this paper, we propose H…
We consider online algorithms under both the competitive ratio criteria and the regret minimization one. Our main goal is to build a unified methodology that would be able to guarantee both criteria simultaneously. For a general class of online algorithms, namely any Metrical Task System (MTS), we show that one can sim…
New algorithm calculates -invariants for links efficiently.
problem Cannot be done by standard spectral sequence methods.
method Developed an algorithm for -invariants of links.
result Demonstrated efficiency and applicability to sl(3)-link homology.
Study shows non-existence of certain contact structures on odd-dimensional manifolds.
problem Existence of contact structures with flexible pages on odd-dimensional manifolds.
method Proved a topological obstruction and used symplectic actions to show non-existence.
result Non-existence of contact open books with flexible pages for certain manifolds.
Stability of Homogeneous minimal hypersurfaces in the Page space and Sasaki-Einstein manifoldsmath.DG
Study on stability of minimal submanifolds in specific Einstein manifolds.
problem Investigating stability of minimal submanifolds in Einstein manifolds.
method Analyzing homogeneous minimal hypersurfaces in Page space and Sasaki-Einstein manifolds, computing stability operators and indices.
result Determined all homogeneous, minimal hypersurfaces and computed their stability operators and indices.
A spectral sequence is established, whose page is Bar-Natan's variant of Khovanov homology and which abuts to a deformation of instanton homology for knots and links. This spectral sequence arises as a specialization of a spectral sequence whose page is a characteristic-2 version of homology, in…
Introduces new cohomologies on complex manifolds, extending classical Bott-Chern and Aeppli.
problem Characterizing and studying cohomologies on complex manifolds.
method Introducing -Bott-Chern and -Aeppli cohomologies, extending classical cohomologies.
result Provides analogues of Serre duality and characterizes page---manifolds.
We give explicit formulas and algorithms for the computation of the rotation number of a nullhomologous Legendrian knot on a page of a contact open book. On the way, we derive new formulas for the computation of the Thurston-Bennequin invariant of such knots and the Euler class and the d3-invariant of the underlying co…
We show that the page at which the Lee spectral sequence collapses gives a bound on the unknotting number, u(K). In particular, for knots with u(K)<3, we show that the Lee spectral sequence must collapse at the E_2 page. An immediate corollary is that the Knight Move Conjecture is true when u(K)<3.
This paper presents a Convolutional Neural Network (CNN) based page segmentation method for handwritten historical document images. We consider page segmentation as a pixel labeling problem, i.e., each pixel is classified as one of the predefined classes. Traditional methods in this area rely on carefully hand-crafted …