We give a new proof of McShane's classification of simple cuspidal geodesics, using simple equivariant methods in the hyperbolic plane.
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 “SIMPLE method”
The paper finds braid representatives minimizing simple walks for knots.
problem Finding efficient braid representatives for knots.
method Developed methods to minimize the number of simple walks in braids.
result Computed the colored Jones polynomial for specific knots.
Method reconstructs networks from contagion dynamics.
problem Fitting contagion models assumes simple dynamics, ignoring complex contagions.
method Nonparametric method to reconstruct network and dynamics from node states.
result Networks are easier to reconstruct through complex contagions in dense or saturated networks.
SIMPLE-RC method tests group membership profiles in large networks with weak signals.
problem Testing group membership profiles in large networks with weak signals.
method Random coupling technique to construct maximum SIMPLE tests for subsampled node pairs.
result Asymptotic distributions of SIMPLE-RC test are derived, enabling delicate analysis.
We present a new simple method of estimating stochastic volatility and its volatility. This method is applicable to both cross-sectional and time-series data. Moreover, this method does not require volatility data series.
Most simple braids have positive topological entropy.
problem Understanding the topological entropy of simple braids.
method Reduction from simple braids to non-simple 3-strand braids.
result The proportion of simple braids with positive entropy approaches 100% as the number of strands increases.
Study on functional inequalities on simple edge spaces.
problem Whether classical functional inequalities hold in simple edge spaces.
method Analyzing Sobolev and Poincaré inequalities, proving optimality of Sobolev constant.
result Optimality result concerning the B-constant of the Sobolev inequality.
Study earthquake deformations on a once-punctured torus.
problem Understanding earthquake deformations on Teichmüller space.
method Two methods: linear recurrence relations and hyperbolic geometry.
result Algebraic and geometric interpretations of earthquake deformations.
SPCA improves PCA by learning from simple to complex samples.
problem Noise and outliers in complex data.
method Self-paced Principal Component Analysis (SPCA) that integrates samples from simple to more complex.
result SPCA improves state-of-the-art results on popular datasets.
Discrete-time systems can be characterized by simple flat coordinates and their shifts.
problem Characterizing flatness of discrete-time systems.
method Developed a map from flat coordinates and their shifts to system state and input, fulfilling system equations identically.
result Derived necessary conditions for a system to be flat, without requiring differential geometry methods.
Fibered simple knotsmath.GT
Simple knots in lens spaces fiber if their order doesn't divide certain Euclidean remainders.
problem Characterizing fibered simple knots in lens spaces.
method Direct, combinatorial, and geometric methods.
result Conditions for fibered simple knots in lens spaces are determined.
Simple aggregation of multiple methods defends against adversarial attacks on neural networks.
problem Manipulation of machine learning models to hide discriminating features.
method Aggregation of multiple explanation methods to make the model robust against adversarial attacks.
result The model remains robust even when the attacker has knowledge of the model weights and explanation methods.
Simple method disentangles content and style from pre-trained vision models.
problem Learning interpretable features in visual representations.
method Probabilistic linear entanglement model and simple disentanglement algorithm.
result Method provably disentangles content and style features.
A simple method improves batch active learning without high compute.
problem Efficient batch active learning in machine learning.
method Adapting standard single-point acquisition strategies to batch.
result Simple strategy performs as well as advanced batch methods.
Over-parameterized deep neural networks trained by simple first-order methods are known to be able to fit any labeling of data. Such over-fitting ability hinders generalization when mislabeled training examples are present. On the other hand, simple regularization methods like early-stopping can often achieve highly no…
In this paper we introduce a novel method of gradient normalization and decay with respect to depth. Our method leverages the simple concept of normalizing all gradients in a deep neural network, and then decaying said gradients with respect to their depth in the network. Our proposed normalization and decay techniques…
New proofs confirm travel time data determine simple metrics on a disc.
problem Determining a simple Riemannian metric from travel time data.
method Proofs based on Myers-Steenrod theorem, Lipschitz-type stability estimate.
result Travel time data determine a simple Riemannian metric on a disc up to natural gauge.
Neyshabur and Srebro proposed Simple-LSH, which is the state-of-the-art hashing method for maximum inner product search (MIPS) with performance guarantee. We found that the performance of Simple-LSH, in both theory and practice, suffers from long tails in the 2-norm distribution of real datasets. We propose Norm-rangin…
Skewing Quanto with Simplicityq-fin.MF
Simple method solves Quanto Skew problem.
problem Quanto Skew problem in Equities and FX.
method Analytical method that accommodates Equity and FX volatility skew.
result Highly efficient and fast performance.
A simple regularization method improves model generalization.
problem Overfitting due to lack of labeled data in machine learning models.
method Density-fixing regularization method based on class prior distribution.
result Improves model generalization performance by approximating class prior distribution.
This paper is a survey on the Lickorish type construction of some kind of closed manifolds over simple convex polytopes. Inspired by Lickorish's theorem, we propose a method to describe certain families of manifolds over simple convex polytopes with torus action. Under this construction, many classical classification r…
There is great interest in "saliency methods" (also called "attribution methods"), which give "explanations" for a deep net's decision, by assigning a "score" to each feature/pixel in the input. Their design usually involves credit-assignment via the gradient of the output with respect to input. Recently Adebayo et al.…
Neural linear model performs well on simple regression tasks but requires tuning.
problem Characterizing the neural linear model's performance on simple regression tasks.
method Characterized the neural linear model on UCI and gap datasets.
result The neural linear model shows good performance but requires good hyperparameter tuning.
Learning automatically the best activation function for the task is an active topic in neural network research. At the moment, despite promising results, it is still difficult to determine a method for learning an activation function that is at the same time theoretically simple and easy to implement. Moreover, most of…
Neural networks have recently had a lot of success for many tasks. However, neural network architectures that perform well are still typically designed manually by experts in a cumbersome trial-and-error process. We propose a new method to automatically search for well-performing CNN architectures based on a simple hil…
A simple method flags images as out-of-distribution based on their distance to nearest neighbors.
problem Detecting images not aligned with a trained model's in-distribution data.
method Flag images as OOD if their average distance to K nearest neighbors is large in the classifier's representation space.
result Simple methods can outperform more complex ones when considering learned representations.
Natural-gradient methods enable fast and simple algorithms for variational inference, but due to computational difficulties, their use is mostly limited to \emph{minimal} exponential-family (EF) approximations. In this paper, we extend their application to estimate \emph{structured} approximations such as mixtures of E…
A new method for effective VAE training using calibrated decoders.
problem Training VAEs requires hyperparameter tuning, leading to inefficiency.
method Calibrated decoders that learn uncertainty and automatically determine information retention.
result Calibrated decoders can simplify VAE training without heuristic modifications.
We provide new exact Taylor's series with fixed coefficients and without the remainder. We demonstrate the usefulness of this contribution by using it to obtain very simple solutions to (non-linear) PDEs. We also apply the method to the portfolio model.
A simple framework improves deep metric learning performance.
problem Imbalanced data pairs in pairwise deep metric learning.
method Formulated a robust loss for balanced pairs over mini-batches, using distributionally robust optimization.
result Empirically outperforms state-of-the-art methods.
We give optimal lower bounds for the number of sextactic points on a simple closed curve in the real projective plane. Sextactic points are after inflection points the simplest projectively invariant singularities on such curves. Our method is axiomatic and can be applied in other situations.
Simple method improves deep classifier accuracy under noisy labels.
problem Training deep classifiers with noisy labels.
method Probabilistic approach using temperature parameterized softmax.
result Improves accuracy, log-likelihood and calibration on noisy datasets.
New method to classify simple Smale flows on .
problem Classifying simple Smale flows on .
method Embedded template and Kauffman's invariant of spatial graphs.
result Isotopic classification of simple Smale flows on .
Simple stochastic Newton and cubic Newton methods with fast convergence.
problem Minimizing large numbers of smooth and strongly convex functions.
method Stochastic Newton and cubic Newton methods with simple local linear-quadratic rates.
result Local linear-quadratic convergence results with fast adaptation to problem's curvature.
There has been recent interest in improving performance of simple models for multiple reasons such as interpretability, robust learning from small data, deployment in memory constrained settings as well as environmental considerations. In this paper, we propose a novel method SRatio that can utilize information from hi…
Simple fine-tuning of GANs with frozen discriminator outperforms existing methods.
problem Fine-tuning GANs requires numerous data and heavy computation.
method Freeze lower layers of the discriminator for fine-tuning.
result FreezeD significantly outperforms previous techniques on various datasets.
Simple mean and std-based classifier outperforms chance on 69 out of 128 time-series problems.
problem Time-series classification accuracy comparison
method Linear classifier using mean and standard deviation features
result Simple distributional features outperform chance on 69 out of 128 time-series problems
This article studies the financial time series data processing for machine learning. It introduces the most frequent scaling methods, then compares the resulting stationarity and preservation of useful information for trend forecasting. It proposes an empirical test based on the capability to learn simple data relation…
Simple neural net outperforms complex uncertainty methods.
problem Reliable uncertainty estimation from deterministic models.
method A simple baseline using a single softmax neural net with residual connections and spectral normalization.
result Simple neural net outperforms DUQ and SNGP on uncertainty prediction.
We give a simple and practical algorithm to compute the link polynomials, which are defined according to the skein relations. Our method is based on a new total order on the set of all braid representatives. As by-product a new complete link invariant are obtained.
Study shows contact structure on null geodesic space for specific spacetimes.
problem Understanding contact structures on null geodesic spaces of spacetimes.
method Contactomorphism and embedding techniques in spherical cotangent bundles.
result Space of null geodesics contactomorphic to canonical structure in spherical cotangent bundle.
Knowledge graph based simple question answering (KBSQA) is a major area of research within question answering. Although only dealing with simple questions, i.e., questions that can be answered through a single knowledge base (KB) fact, this task is neither simple nor close to being solved. Targeting on the two main ste…
SIAN bridges simple models to neural networks by identifying necessary feature combinations.
problem The gap between simple models and powerful neural networks in performance.
method Feature interaction detection and sparse selection algorithm.
result Competitive performance across multiple tabular datasets with optimal tradeoff.
The main result of this paper is a negative answer to the question: are all transversal knot types transversally simple? An explicit infinite family of examples is given of closed 3-braids that define transversal knot types that are not transversally simple. The method of proof is topological and indirect.
A simple and efficient numerical method for pricing discretely monitored early-exercise optionsq-fin.CP
We present a simple, fast, and accurate method for pricing a variety of discretely monitored options in the Black-Scholes framework, including autocallable structured products, single and double barrier options, and Bermudan options. The method is based on a quadrature technique, and it employs only elementary calculat…
In the past, Acoustic Scene Classification systems have been based on hand crafting audio features that are input to a classifier. Nowadays, the common trend is to adopt data driven techniques, e.g., deep learning, where audio representations are learned from data. In this paper, we propose a system that consists of a …
A new BN method corrects size mismatch in WLF for imbalanced data.
problem Learning from imbalanced datasets in neural networks.
method Proposes weighted batch normalization (WBN) to correct size mismatch between BN and WLF.
result WBN corrects size mismatch and improves classification performance in imbalanced datasets.
A new imitation learning method uses random search for simple policies, outperforming complex models.
problem Complexity and reward dependency issues in imitation learning.
method Derivative-free optimization with simple linear policies and random search.
result The proposed method achieves competitive performance on MuJoCo locomotion tasks without a direct reward signal.