Research
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

12.5%25.0%37.5%50.0% · Apr 199419922001200920172026
48 results for logarithmic separation

Logarithmic separation profile in hyperbolic groups shows hierarchical structure.

problem Understanding hierarchical structure in hyperbolic groups with logarithmic separation.
method Proving groups with logarithmic separation split over cyclic groups and providing counterexamples.
result Not all groups with hierarchical structure have logarithmic separation profile.

Optimal ReLU networks can memorize any separable set of points with a small number of parameters.

problem The optimal number of parameters required to memorize a set of points using ReLU networks.
method Construction of ReLU networks with specific bit complexity to memorize points satisfying a mild separability assumption.
result Optimal ReLU networks can memorize any separable set of points with a number of parameters that is ildeO(N) ilde{O}(\sqrt{N}).

Paper proves tight lower bounds for online multicalibration, separating it from marginal calibration.

problem Proving lower bounds for online multicalibration in relation to marginal calibration.
method Information-theoretic approach, constructing group families from orthonormal bases.
result Establishes tight lower bounds for online multicalibration, matching upper bounds up to logarithmic factors.

Optimizes quantile and semi-adversarial regret with novel root-logarithmic regularizers.

problem Minimizes regret in adversarial and semi-adversarial online learning.
method FTRL with root-logarithmic regularizers for quantile and semi-adversarial settings.
result Achieves minimax optimal regret bounds in both paradigms.

We adress the maximization problem of expected utility from terminal wealth. The special feature of this paper is that we consider a financial market where the price process of risky assets can have a default time. Using dynamic programming, we characterize the value function with a backward stochastic differential equ…

2008-11-28abs ↗pdf ↗

AIHT improves online high-dimensional quantile regression by separating support discovery and refinement.

problem Online high-dimensional quantile regression with structural sparsity.
method Adaptive Iterative Hard Thresholding (AIHT) alternates stochastic updates with adaptive hard-thresholding steps.
result AIHT achieves logarithmic regret for the sliding-window objective in high-dimensional settings.

We consider the closeness testing problem for discrete distributions. The goal is to distinguish whether two samples are drawn from the same unspecified distribution, or whether their respective distributions are separated in L1L_1-norm. In this paper, we focus on adapting the rate to the shape of the underlying distri…

2019-02-01abs ↗pdf ↗

This work introduces reward teaching for federated multi-armed bandits to guide clients towards global optimality.

problem Existing federated multi-armed bandits designs assume clients will follow the server's protocol, but this is not always feasible.
method Introduces reward teaching where the server adjusts clients' local rewards to encourage global optimality, using phased Teaching-After-Learning (TAL) and Teaching-While-Learning (TWL) algorithms.
result Demonstrates that TAL achieves logarithmic regrets with only logarithmic adjustment costs, and TWL outperforms TAL for UCB1 clients.

Transformers can learn noisy linear systems with depth and IID data.

problem Learning noisy linear dynamical systems with transformers.
method Theoretical analysis of multi-layer and single-layer transformers with respect to L2L^2-testing loss.
result Single-layer transformers have a non-diminishing lower bound on approximation error, suggesting depth separation.

We examine gradient descent on unregularized logistic regression problems, with homogeneous linear predictors on linearly separable datasets. We show the predictor converges to the direction of the max-margin (hard margin SVM) solution. The result also generalizes to other monotone decreasing loss functions with an inf…

2017-10-27abs ↗pdf ↗

We consider the problem of utility maximization for small traders on incomplete financial markets. As opposed to most of the papers dealing with this subject, the investors' trading strategies we allow underly constraints described by closed, but not necessarily convex, sets. The final wealths obtained by trading under…

2005-08-24abs ↗pdf ↗

A new method for estimating probabilities and risks using Markov processes.

problem Computational difficulties in classical importance sampling for latent Markov models.
method Proposes a new importance sampling framework that minimizes estimator variance.
result Shows logarithmic efficiency of the proposed estimator.

This paper compares Transformers and RNNs in various tasks, showing size differences.

problem Comparing representational capabilities of Transformers and RNNs across tasks.
method Analysis of differences in tasks like index lookup, nearest neighbor, and string equality.
result Size differences in Transformers and RNNs for various tasks.

GCNs distinguish graph models based on embeddings, but depth matters.

problem GCNs distinguish between different random graph models.
method Investigated the power of GCNs of varying depths to distinguish between graph models.
result GCNs with logarithmic depth can distinguish certain graphons, but simpler architectures suffice for others.

We introduce jet topics: a framework to identify underlying classes of jets from collider data. Because of a close mathematical relationship between distributions of observables in jets and emergent themes in sets of documents, we can apply recent techniques in "topic modeling" to extract jet topics from data with mini…

2018-01-31abs ↗pdf ↗

Let G be a countable group which acts by isometries on a separable, but not necessarily proper, Gromov hyperbolic space X. We say the action of G is weakly hyperbolic if G contains two independent hyperbolic isometries. We show that a random walk on such G converges to the Gromov boundary almost surely. We apply the co…

2014-10-15abs ↗pdf ↗

Algorithm distinguishes Gaussian mixtures from pure Gaussians in quasi-polynomial time.

problem Distinguishing mixtures of Gaussian components from pure Gaussians, especially when components are well-separated.
method Sum-of-Squares method, quasi-polynomial time algorithm, bipartitioning sample to separate components.
result Algorithm can reliably distinguish between mixtures and pure Gaussians in quasi-polynomial time.

Study shows a universal local obstruction to the Samuelson condition for tangent Lagrangian 2-webs.

problem Obstruction to the Samuelson condition for tangent Lagrangian 2-webs.
method Local analysis of tangent lines and their intersection maps.
result A universal local phenomenon produces a nonzero mixed derivative, obstructing the Samuelson condition.

Linear memory stores associations up to a logarithmic scale, but listwise retrieval can handle a quadratic scale.

problem How many key-value associations can a linear memory store?
method Analyzed linear memory models for top-1 and listwise retrieval, proving phase transitions and developing asymptotic theories.
result Linear memory has a logarithmic capacity for top-1 retrieval and a quadratic capacity for listwise retrieval.

Paper improves DP-ERM for binary linear classification with large-margin subsets.

problem Differentially private binary linear classification with large-margin subsets.
method Efficient (ε,δ)(\varepsilon,δ)-DP algorithm with empirical zero-one risk bound.
result Improved empirical zero-one risk bound for binary linear classification.

We analyze the classical EM algorithm for parameter estimation in the symmetric two-component Gaussian mixtures in dd dimensions. We show that, even in the absence of any separation between components, provided that the sample size satisfies n=Ω(dlog3d)n=Ω(d \log^3 d), the randomly initialized EM algorithm converges to an esti…

2019-08-28abs ↗pdf ↗

Study designs experiments to identify causal graph structure with cycles and latent confounders.

problem Identify causal graph structure with cycles and latent confounders.
method Established lower bounds, developed CI and do see tests algorithms, and proved tightness.
result Proposed algorithms can recover all causal edges except for double adjacent bidirected edges.

Adaptive model selection for RL with unknown function classes.

problem Model selection for RL with unknown function classes.
method Proposed adaptive algorithms that adapt to the smallest function class containing the true model.
result Cumulative regret matches that of an oracle with known function classes.

Study real logarithms of semi-simple matrices, focusing on differential structure.

problem Understanding the differential structure of real logarithms of semi-simple matrices.
method Examines the differential structure of real logarithms of semi-simple matrices under specific matrix types.
result Characterizes the differential structure of real logarithms of semi-simple matrices.

Study excess logarithmic residues for foliations to bound invariant hypersurfaces and test log canonicity.

problem Bounding invariant hypersurfaces and testing log canonicity of singularities.
method Introduce excess logarithmic residues, prove residue formula, derive Poincaré-type bound, and use them to recover log discrepancies.
result Componentwise logarithmic residues of a lifted foliation along the exceptional divisor recover log discrepancies of singularities.

Logarithmic connections on principal bundles over normal varieties are studied.

problem Existence and properties of logarithmic connections on principal bundles over normal varieties.
method Introducing logarithmic connections, showing equivalence to covariant derivatives, and proving existence conditions.
result Existence of logarithmic connections on principal bundles over normal varieties is equivalent to certain conditions on the associated vector bundles and adjoint bundles.

We present a new method to solve certain ˉ\bar{\partial}-equations for logarithmic differential forms by using harmonic integral theory for currents on Kahler manifolds. The result can be considered as a ˉ\bar{\partial}-lemma for logarithmic forms. As applications, we generalize the result of Deligne about closedness…

2017-07-31abs ↗pdf ↗

Paper uses ABP method to prove logarithmic Sobolev inequalities on curved spaces.

problem Proving logarithmic Sobolev inequalities on manifolds with nonnegative curvature.
method Employing the ABP method developed by Brendle.
result Sharp L2L^2 and LpL^p logarithmic Sobolev inequalities established.

Study improves privacy-preserving online prediction from experts with speed-ups.

problem Privacy-preserving online prediction from experts with speed-ups.
method Differentially private federated online prediction algorithms.
result Achieves mm-fold regret speed-up with low-loss expert in federated setting.

The paper constructs a Saito basis for a specific class of divisors and applies it to logarithmic Poisson geometry.

problem Investigating a class of non-quasi-homogeneous free divisors and their logarithmic vector fields.
method Explicitly constructing a Saito basis for the module of logarithmic vector fields and applying it to logarithmic Poisson geometry.
result The construction of the Saito basis and the Lie-Rinehart algebra structure on the sheaf of logarithmic 1-forms.

In this work, we give a formula for the logarithmic invariant of knots in terms of certain derivatives of the colored Jones invariant. This invariant is related to the logarithmic conformal field theory, and was defined by using the centers in the radical of the restricted quantum group at root of unity. A relation bet…

2014-06-05abs ↗pdf ↗

Study of conformal logarithmic Laplacian on sphere, connecting Yamabe problems and Sobolev spaces.

problem Yamabe-type problems and Sobolev spaces on the sphere.
method Detailed spectral analysis, conformal invariance, and Hilbert space introduction.
result Established precise connection between sphere and \(\mathbb{R}^N\) logarithmic Laplacian.

Paper finds necessary condition for logarithmic Minkowski problem in higher dimensions.

problem Logarithmic Minkowski problem in higher dimensions.
method Established a necessary condition through generalization and refinement of previous work.
result Generalizes and refines necessary condition for logarithmic Minkowski problem.

We construct helicoid-like embedded minimal disks with axes along self-similar curves modeled on logarithmic spirals. The surfaces have a self-similarity inherited from the curves and the nature of the construction. Moreover, inside of a "logarithmic cone", the surfaces are embedded.

2014-04-28abs ↗pdf ↗

Bandit algorithms struggle with consistent performance and robustness.

problem Achieving consistent and robust performance in stochastic multi-armed bandit settings.
method Analyzing regret minimization trade-offs and proposing distribution-oblivious algorithms.
result Logarithmic regret is inconsistent and super-logarithmic regret is necessary for consistent learning.