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,695 papers · 148 categories

Trend · papers per month

7152229 · Jun 202619922001200920172026
48 results for clean markings

SARD improves adversarial robustness in two-stage L2D systems.

problem Adversarial attacks can manipulate query allocation in two-stage L2D systems.
method Introduces SARD, a convex learning algorithm with provable guarantees.
result SARD significantly improves robustness under adversarial attacks while maintaining strong clean performance.

Neural networks learn clean data patterns first, then noisy data, leading to improved performance initially but deteriorating later.

problem Improvement in prediction error on clean data during early training of neural networks with noisy labels.
method Theoretical analysis and experiments to explore the dynamics of gradient descent and the impact of clean and noisy data.
result Neural networks prioritize learning clean data patterns first, leading to improved performance initially but deteriorating later due to diminishing gradient dominance of clean samples over noisy ones.

We present a marked analogue of Carter and Saito's movie theorem. Our definition of marking was chosen to coincide with the markings that arise in link Floer homology. In order to deal with complications arising from certain isotopies, we define three equivalence relations for marked surfaces and work over an equivalen…

2014-07-17abs ↗pdf ↗

We are now witnessing the increasing availability of event stream data, i.e., a sequence of events with each event typically being denoted by the time it occurs and its mark information (e.g., event type). A fundamental problem is to model and predict such kind of marked temporal dynamics, i.e., when the next event wil…

2017-01-14abs ↗pdf ↗

New model captures time and mark inter-dependence in TPPs.

problem Limited predictive performance of conditionally independent TPP models on entangled time and mark interactions.
method Developed a multivariate TPP that models conditional inter-dependence of time and mark, using both intensity-based and intensity-free models.
result Proposed TPP models outperform conditionally independent and dependent models in standard prediction tasks.

The paper cleans label noise in supervised classification using Bernoulli sampling.

problem Label noise degrades supervised classifier performance.
method Proposes a label noise cleaning method based on Bernoulli random sampling.
result The method separates clean and noisy observations without prior label information.

Methodology for estimating marked Hawkes processes with neural networks.

problem Estimating conditional intensity of marked Hawkes processes.
method Proposes two models: Shallow Neural Hawkes with marks and Neural Network for Non-Linear Hawkes with Marks.
result Validation on synthetic datasets and real-world cryptocurrency order book data.

Study approximate marked length spectrum rigidity in non-positively curved groups.

problem Approximate rigidity of marked length spectra in non-positively curved groups.
method Compare marked length spectra of isometric actions of groups with non-positively curved features.
result Supremum of quotient of marked length spectra is approximately determined by restricted spectra.

Motivated by the prediction of cell loads in cellular networks, we formulate the following new, fundamental problem of statistical learning of geometric marks of point processes: An unknown marking function, depending on the geometry of point patterns, produces characteristics (marks) of the points. One aims at learnin…

2018-12-19abs ↗pdf ↗

PClean automates Bayesian data cleaning for specific datasets.

problem Bayesian inference for diverse and complex data cleaning.
method Domain-specific probabilistic programming language with custom models and inference.
result PClean programs outperform general-purpose PPLs in accuracy and runtime.

We use Fox calculus to assign a marked polytope to a `nice' group presentation with two generators and one relator. Relating the marked vertices to Novikov-Sikorav homology we show that they determine the Bieri-Neumann-Strebel invariant of the group. Furthermore we show that in many cases the marked polytope is an inva…

2015-01-14abs ↗pdf ↗

It is known that evaluating a certain approximation to the Jones polynomial for the plat closure of a braid is a BQP-complete problem. That is, this problem exactly captures the power of the quantum circuit model. The one clean qubit model is a model of quantum computation in which all but one qubit starts in the maxim…

2007-07-19abs ↗pdf ↗

Quantum duality map extended to general marked surfaces and its compatibility with skein algebras proven.

problem Generalizing quantum duality map to general marked surfaces and proving its compatibility with skein algebras.
method Generalized quantum duality map, reduced stated skein algebras, quantum trace maps, skein lifting.
result Compatibility of quantum duality map with skein algebras proven.

In this paper, we construct the moduli space of marked oper structures on a closed, oriented smooth surface of negative Euler characteristic as a holomorphic fiber bundle over Teichmüller space. We prove that the holonomy map from the space of marked oper structures to the moduli space of reductive flat bundles is a ho…

2018-04-12abs ↗pdf ↗

Policy shifts between Trump and Biden impact ESG investments, creating volatility.

problem Dramatic policy shifts between Trump and Biden administrations affect ESG investments.
method Analyzes contrasting policies of Trump and Biden administrations and their impacts on ESG investments.
result Policy changes significantly influence ESG investments, leading to volatility and portfolio reassessment.

In all dimensions, we prove that the marked length spectrum of a Riemannian manifold (M,g)(M,g) with Anosov geodesic flow and non-positive curvature locally determines the metric in the sense that two close enough metrics with the same marked length spectrum are isometric. In addition, we provide a completely new stabilit…

2018-06-11abs ↗pdf ↗

Survey of stated skein modules/algebras of 3-manifolds/surfaces.

problem Understanding stated skein modules/algebras of 3-manifolds/surfaces.
method Discussion of splitting homomorphism, general structures, Frobenius homomorphism, center, dimension, representation theory.
result Skein algebra of non-closed marked surface at any root of 1 is a maximal order.

We show that all GL(2,R) equivariant point markings over orbit closures of translation surfaces arise from branched covering constructions and periodic points, completely classify such point markings over strata of quadratic differentials, and give applications to the finite blocking problem.

2017-08-10abs ↗pdf ↗

Study improves resilience against adversarial clean-label attacks in real and noisy settings.

problem Ensuring accurate predictions in the presence of adversarial clean-label samples.
method Sequential learning from a stream of i.i.d. data, allowing abstention for uncertain predictions.
result Theoretical analysis and adaptations for the agnostic setting with a clean-label adversary and noise.

It is well known that surface-links in 4-space can be presented by diagrams on the plane of 4-valent spatial graphs with makers on the vertices, called marked graph diagrams. In this paper we extend the method of presenting surface-links by marked graph diagrams to presenting immersed surface-links. We also give some m…

2017-07-15abs ↗pdf ↗

We prove that the classical set of moves for standard spines of 3-manifolds (i.e. the MP-move and the V-move) does not suffice to relate to each other any two standard skeleta of a 3-manifold with marked boundary. We also describe a condition on the 3-manifold with marked boundary that tells whether the generalised set…

2008-04-04abs ↗pdf ↗

New theorem shows metrics of certain groups are close if their lengths are identical.

problem Identifying metrics of relatively hyperbolic groups from their lengths.
method Proved rigidity for relatively hyperbolic groups using coarse marked length spectrum.
result Metrics of relatively hyperbolic groups are uniformly close if lengths are identical.

Marked vertex diagrams provide a combinatorial way to represent knotted surfaces in R4\mathbb{R}^4; including virtual crossings allows for a theory of virtual knotted surfaces and virtual cobordisms. Biquandle counting invariants are defined only for marked vertex diagrams representing knotted orientable surfaces; we e…

2014-09-27abs ↗pdf ↗

Trimming helps in conformal prediction when it separates anomaly scores.

problem Effectiveness of trimming in conformal prediction under contamination.
method Analyse fixed-threshold trimming as a replacement of the contaminated calibration law with a retained law.
result Trimming helps when it separates anomaly scores, reducing clean-target coverage to a one-dimensional score-CDF transfer problem.

In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily modified to handle graphs with weighted vertices. We present formulas that simp…

2009-05-29abs ↗pdf ↗

New method improves false-/true-positive-rate estimation in fraud detection with noisy labels.

problem Estimating FPR/TPR in fraud detection with class-conditional label noise.
method Directly cleaning model's validation data to de-correlate cleaning error with model scores.
result Improves accuracy of FPR/TPR estimates, especially in asymmetric label noise scenarios.

Improved portfolio optimization method yields better risk-adjusted returns.

problem Optimizing global minimum variance portfolios with reduced risk.
method k-fold boosted kk-BAHC covariance cleaning procedure for correlation matrices.
result Our method outperforms other filtering methods in Sharpe ratios, despite higher turnover.

We apply basic statistical reasoning to signal reconstruction by machine learning -- learning to map corrupted observations to clean signals -- with a simple and powerful conclusion: it is possible to learn to restore images by only looking at corrupted examples, at performance at and sometimes exceeding training using…

2018-03-12abs ↗pdf ↗

SSMs can be poisoned with clean labels, leading to generalization failure.

problem The implicit bias of SSMs can be manipulated by including special training examples with clean labels.
method Formal proof and empirical demonstration of the phenomenon.
result SSMs can fail to generalize even with clean labels, due to the inclusion of special training examples.

Cincer cleans both new and past data by identifying and relabeling suspicious and counter-examples.

problem Sequential learning under label noise, especially in applications with human supervision.
method Cincer uses example-based explanations to identify and relabel suspicious and counter-examples, leveraging Fisher information matrix approximation.
result Cincer achieves better data and models by clarifying the model's suspicions, especially with FIM approximation.

In this paper, we present a reverberation removal approach for speaker verification, utilizing dual-label deep neural networks (DNNs). The networks perform feature mapping between the spectral features of reverberant and clean speech. Long short term memory recurrent neural networks (LSTMs) are trained to map corrupted…

2018-09-08abs ↗pdf ↗