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.

169,051 papers · 148 categories

Trend · papers per month

10202939 · Jun 202019922001200920182026
48 results for histone modifications

DeepDiff predicts differential gene expression from histone modifications using deep learning.

problem Predicting differential gene expression from histone modification signals, capturing combinatorial effects.
method Attention-based deep learning architecture with multiple LSTM modules and attention mechanisms.
result DeepDiff significantly outperforms state-of-the-art baselines for differential gene expression prediction.

Many proteoforms - arising from alternative splicing, post-translational modifications (PTMs), or paralogous genes - have distinct biological functions, such as histone PTM proteoforms. However, their quantification by existing bottom-up mass-spectrometry (MS) methods is undermined by peptide-specific biases. To avoid …

2017-08-05abs ↗pdf ↗

With the wealth of high-throughput sequencing data generated by recent large-scale consortia, predictive gene expression modelling has become an important tool for integrative analysis of transcriptomic and epigenetic data. However, sequencing data-sets are characteristically large, and previously modelling frameworks …

2015-07-21abs ↗pdf ↗

We consider the task of detecting regulatory elements in the human genome directly from raw DNA. Past work has focused on small snippets of DNA, making it difficult to model long-distance dependencies that arise from DNA's 3-dimensional conformation. In order to study long-distance dependencies, we develop and release …

2017-10-03abs ↗pdf ↗

This work improves testing of machine learning model modifications using novel statistical methods.

problem Overfitting and conservative Bonferroni correction when testing multiple model modifications.
method Introduces alpha-recycling and SRGPs to control error rate and approve more beneficial modifications.
result Novel statistical methods approve a higher number of beneficial modifications than previous approaches.

New method detects RNA modifications without prior training, revealing novel sites.

problem Detecting RNA modifications with high accuracy and sensitivity.
method Anomaly detection using nanopore raw ionic current signals and nearest neighbor comparison.
result Detects diverse RNA modifications without prior training, including a novel 2'-O-methylated site in DENV.

We define an operation on homology B4{B}^4 which we call an nn-twist annulus modification. We give a new construction of smoothly slice knots and exotically slice knots via nn-twist annulus modifications. As an application, we present a new example of a smoothly slice knot with non-slice derivatives. Such examples we…

2015-12-01abs ↗pdf ↗

Study shows stability of locally conformally balanced condition under modifications but not under small deformations.

problem Stability of locally conformally balanced condition under small deformations and modifications.
method Proved stability under proper modifications and instability under small deformations using examples and Hilbert-Chow map.
result Stability of locally conformally balanced condition under proper modifications and instability under small deformations.

Behavior modification improves prediction accuracy by nudging user behavior.

problem Improving prediction accuracy using behavior modification techniques.
method Combining prediction and behavior modification with reinforcement learning algorithms.
result Behavior modification can make predictions more certain but may not generalize.

Paper proposes adversarial modifications for link prediction models to improve robustness and interpretability.

problem Improving accuracy is not enough; robustness and interpretability are also crucial for link prediction models.
method Adversarial modifications to identify influential facts and evaluate model sensitivity and interpretability.
result The approach identifies the most influential facts and evaluates the sensitivity of link prediction models to additional facts.

Study of unimodular Sasaki and Vaisman Lie groups, determining all modifications explicitly.

problem Classifying unimodular Sasaki and Vaisman Lie groups.
method Applying the technique of modification to determine all homogeneous Sasaki and Vaisman manifolds of unimodular Lie groups explicitly.
result Complete classification of unimodular Sasaki and Vaisman Lie groups.

Paper proposes using pairwise feature comparisons to infer modification costs for user recourse.

problem Learning and inferring user preferences for modifying features in black-box models.
method Bradley-Terry model for inferring feature-wise costs from non-exhaustive human comparison surveys.
result Non-exhaustive human surveys can efficiently learn feature costs, enabling recourse finding.

Max-Cut decision tree improves classification accuracy and reduces computation time.

problem Improving decision tree accuracy and efficiency for complex classification tasks.
method Alternative splitting metric (max cut) and PCA-based feature selection at each node.
result 49% improvement in accuracy with 94% reduction in CPU time on CIFAR-100 data.

We briefly review the approach to optimization of portfolios according to the theory of Markowitz and propose a further modification that can improve the outcome of the optimization process. The modification takes account of the entropic contribution from the time series used to compute the parameters in the Markowitz …

2014-08-01abs ↗pdf ↗

Kapustin and Witten associate a Hecke modification of a holomorphic bundle over a Riemann surface to a singular monopole on a Riemannian surface times an interval satisfying prescribed boundary conditions. We prove existence and uniqueness of singular monopoles satisfying prescribed boundary conditions for any given He…

2008-04-23abs ↗pdf ↗

We present an axiomatic modification of quaternionic quantum mechanics with a possible-worlds semantics capable of predicting essential "nonquantum" features of an observable universe model - the dimensionality and topology of spacetime, the existence, the signature and a specific form of a metric on it, and certain na…

2007-02-28abs ↗pdf ↗

Label smoothing improves model robustness against misspecification.

problem Improving model robustness against model misspecification.
method Introducing modified label smoothing (MLSLR) that maintains consistent probability estimation while modifying the loss function.
result MLSLR exhibits higher robustness against model misspecification than conventional label smoothing.

Automatic video modification to hide faces while maintaining pose, illumination, and expression.

problem Face de-identification in video to protect identities.
method A novel feed-forward encoder-decoder network architecture conditioned on facial image high-level representation.
result Fully automatic video modification at high frame rates with minimal distortion.

In this paper, we consider a proper modification f:M~Mf : \tilde M \to M between complex manifolds, and study when a generalized pp-Kähler property goes back from MM to M~\tilde M. When ff is the blow-up at a point, every generalized pp-Kähler property is conserved, while when ff is the blow-up along a submanifold, t…

2015-03-30abs ↗pdf ↗

Thompson Sampling remains differentially private with minimal modifications.

problem Ensuring privacy in Thompson Sampling for multi-arm bandits.
method Demonstrated differential privacy of original Thompson Sampling, provided per-round guarantees, and introduced modifications for tighter privacy.
result Privacy guarantees can be tuned by modifying the algorithm, and these modifications impact expected regret.

Proposes a probabilistic method for generating semantically-aware adversarial examples.

problem Generating adversarial examples that are difficult for humans to detect while preserving semantics.
method Embeds subjective understanding of semantics as a distribution into adversarial example generation.
result Achieves higher success rates in circumventing adversarial defense mechanisms.

We consider constraint-based methods for causal structure learning, such as the PC-, FCI-, RFCI- and CCD- algorithms (Spirtes et al. (2000, 1993), Richardson (1996), Colombo et al. (2012), Claassen et al. (2013)). The first step of all these algorithms consists of the PC-algorithm. This algorithm is known to be order-d…

2012-11-14abs ↗pdf ↗

Modified BFGS and LBFGS++ libraries boost performance for non-parallelizable functions.

problem Improving performance of non-parallelizable functions using SIMD and AAD.
method Modifications to BFGS and LBFGS++ libraries, utilizing SIMD and Automatic Differentiation (AAD).
result Up to 3.8 times faster for European Swaption curve calibration and 1.4 times faster for LMM model calibration.

MCD automates counterfactual design searches for multi-modal tasks.

problem Designing for multi-objective goals and complex constraints.
method Model-agnostic counterfactual search method for multi-modal design modifications.
result MCD streamlines and automates counterfactual search, recommending effective design modifications.

Enhances statistical mechanics solving using VANs with MCMC or importance sampling.

problem Sampling error in solving statistical mechanics using VANs.
method Integrates MCMC or importance sampling to correct sampling error in VANs.
result Asymptotically unbiased estimators for physical quantities are achieved.

A stealthy framework injects faults into DNNs to misclassify images without affecting overall accuracy.

problem Vulnerability of deep neural networks to misclassification attacks.
method Fault sneaking attack using ADMM optimization with constraints on maintaining model accuracy and minimizing parameter modifications.
result The framework can inject multiple sneaking faults into DNNs without reducing overall accuracy.

We discuss a general framework for cutting constructions and reinterpret in this setting the work on non-Abelian symplectic cuts by Weitsman. We then introduce two analogous non-Abelian modification constructions for hyperkähler manifolds: one modifies the topology significantly, the other gives metric deformations. We…

2010-02-09abs ↗pdf ↗

New groups contactomorphic to stratified ones found.

problem Understanding contactomorphic relationships between polarised and stratified Lie groups.
method Constructing modifications of stratified groups and proving contactomorphic relationships.
result Polarised groups are contactomorphic to stratified groups under specific conditions.

The two main topics of this text are as follows: Firstly, three modifications of the theorem of Beltrami will be presented for diffeomorphisms between Riemannian manifolds and a space form which preserve the geodesic circles, the geodesic hyperspheres, or the minimal surfaces, respectively. Secondly, it is defined what…

2009-12-21abs ↗pdf ↗

A new method improves continual learning by replaying pseudo data and using orthogonal weight modification.

problem Catastrophic forgetting in class incremental learning.
method Generative replay with orthogonal weight modification.
result Our method achieves substantial improvement over conventional generative replay and OWM.

In this note we show that for the group G = U(N) the space of Hecke modifications of a rank N vector bundle over a Riemann surface C coincides with the moduli space of solutions of certain non-abelian vortex equations over C . Through the recent work of Kapustin and Witten this then leads to an isomorphism between the …

2009-07-10abs ↗pdf ↗

This paper unifies observability notions for colored graphs and identifies graph modifications to improve observability.

problem Observability of colored graphs and its relationship to graph properties.
method Unified framework of observability notions, graph modifications, and NP-completeness results.
result Identification of graph modifications to improve observability and NP-completeness of one modification problem.

The paper modifies twistor spaces for Kähler surfaces and finds metrics on the modified spaces.

problem Constructing a modified twistor space for Kähler surfaces and studying its properties.
method Constructing a modification S(M)S(M) of the twistor space of a Kähler scalar flat surface MM and studying its complex-geometric and metric properties.
result Complete balanced metrics are constructed on S(M)S(M) and it is shown that S(M)S(M) cannot be Kähler when MM is a compact simple hyperkähler manifold.