There is a technical issue in the analysis that is not easily fixable. We, therefore, withdraw the submission. Sorry for the inconvenience.
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
29 results for “inconvenience”
Paper tackles cost-sensitive diagnosis and learning in healthcare, assigning feature costs based on patient discomfort.
problem Cost-sensitive feature acquisition in healthcare datasets.
method Assigns feature costs based on patient discomfort and provides a method for acquiring a subset of features.
result Comparison of cost-sensitive feature acquisition methods on health datasets.
Liouville domains have become central objects in symplectic and contact geometry. However, the auxiliary data they involve --- namely, Liouville forms --- and the non-compactness of their completions generate some inconvenience. The notion of ideal Liouville domains is designed to suppress these awkward aspects and to …
In clinical practice and biomedical research, measurements are often collected sparsely and irregularly in time while the data acquisition is expensive and inconvenient. Examples include measurements of spine bone mineral density, cancer growth through mammography or biopsy, a progression of defective vision, or assess…
Learning to Generate Synthetic Training Data using Gradient Matching and Implicit Differentiationcs.LG
New methods distill data for deep networks efficiently.
problem Reduction of training data cost and inconvenience.
method Generative teaching networks, gradient matching, Implicit Function Theorem.
result New methods are computationally more efficient and improve model performance.
India runs the fourth largest railway transport network size carrying over 8 billion passengers per year. However, the travel experience of passengers is frequently marked by delays, i.e., late arrival of trains at stations, causing inconvenience. In a first, we study the systemic delays in train arrivals using n-order…
Value aggregation is a general framework for solving imitation learning problems. Based on the idea of data aggregation, it generates a policy sequence by iteratively interleaving policy optimization and evaluation in an online learning setting. While the existence of a good policy in the policy sequence can be guarant…
The paper defines Fenchel conjugate and biconjugate on Hadamard manifolds.
problem Defining Fenchel conjugate and biconjugate on curved spaces.
method Introduced a new definition of Fenchel conjugate and biconjugate on Hadamard manifolds based on the tangent bundle.
result Developed a Fenchel-Moreau Theorem for geodesically convex functions on Hadamard manifolds.
Deep neural network models have recently achieved state-of-the-art performance gains in a variety of natural language processing (NLP) tasks (Young, Hazarika, Poria, & Cambria, 2017). However, these gains rely on the availability of large amounts of annotated examples, without which state-of-the-art performance is rare…
The gamma distribution arises frequently in Bayesian models, but there is not an easy-to-use conjugate prior for the shape parameter of a gamma. This inconvenience is usually dealt with by using either Metropolis-Hastings moves, rejection sampling methods, or numerical integration. However, in models with a large numbe…
Paper presents unsupervised calibration for split conformal classification.
problem Inconvenient requirement of labeled calibration samples.
method Uses unsupervised calibration samples alongside supervised training samples.
result Achieves comparable performance to supervised calibration methods.
Many successful methods have been proposed for learning low dimensional representations on large-scale networks, while almost all existing methods are designed in inseparable processes, learning embeddings for entire networks even when only a small proportion of nodes are of interest. This leads to great inconvenience,…
The goal of task transfer in reinforcement learning is migrating the action policy of an agent to the target task from the source task. Given their successes on robotic action planning, current methods mostly rely on two requirements: exactly-relevant expert demonstrations or the explicitly-coded cost function on targe…
Develops CSI for predicting disease progression from sparse data.
problem Lack of frequent clinical metrics for disease progression.
method Machine learning framework (CSI) for analyzing disease progression from sparse observations.
result CSI effectively predicts disease progression from sparse data.
Analysis of Trade-offs in Fair Principal Component Analysis Based on Multi-objective Optimizationcs.LG
This paper tackles fairness in PCA by balancing it with reconstruction error.
problem Fairness concerns in PCA due to different group representation errors.
method A multi-objective optimization approach to balance fairness and reconstruction error.
result Achieving fairness with minimal loss in reconstruction error.
A new distribution fixes a common error in VAEs, improving image quality.
problem Using a Bernoulli likelihood for pixel data in VAEs.
method Introducing the continuous Bernoulli distribution.
result The continuous Bernoulli improves image quality across various metrics and datasets.
Study on teaching reinforcement learning with Q-learning, reducing sample complexity.
problem Reducing sample complexity in reinforcement learning.
method Characterized teaching dimension for Q-learning under different teacher control, presented optimal teaching algorithms.
result Minimum number of samples needed for reinforcement learning is characterized.
The paper defines and analyzes higher-order Yang-Mills-Higgs functionals and their gradient flows.
problem Analyzing the behavior of higher-order Yang-Mills-Higgs functionals and their gradient flows.
method Gauge fixing technique, -bound of the Higgs field, local -derivative estimates, energy estimates, blow-up analysis.
result Solutions to the gradient flow do not hit finite time singularities under certain conditions.
Persistent de Rham-Hodge Laplacians in Eulerian representation for manifold topological learningmath.DG
New method for manifold topological learning avoids remeshing issues.
problem Persistent homology on manifolds is numerically inconsistent.
method Persistent de Rham-Hodge Laplacians in Eulerian representation.
result Avoids numerical inconsistency over multiscale manifolds.
PaRoT simplifies robust training for deep neural networks.
problem Training deep neural networks to be robust to small input changes.
method Developed a practical framework on TensorFlow for robust training without code modifications.
result PaRoT's performance is comparable to existing methods and is easy to use on real-world models.
Automatic sleep monitoring using ear-EEGphysics.med-ph
The monitoring of sleep patterns without patient's inconvenience or involvement of a medical specialist is a clinical question of significant importance. To this end, we propose an automatic sleep stage monitoring system based on an affordable, unobtrusive, discreet, and long-term wearable in-ear sensor for recording t…
Lactate threshold is considered an essential parameter when assessing performance of elite and recreational runners and prescribing training intensities in endurance sports. However, the measurement of blood lactate concentration requires expensive equipment and the extraction of blood samples, which are inconvenient f…
It is difficult to find the optimal sparse solution of a manifold learning based dimensionality reduction algorithm. The lasso or the elastic net penalized manifold learning based dimensionality reduction is not directly a lasso penalized least square problem and thus the least angle regression (LARS) (Efron et al. \ci…
Surface parameterizations and registrations are important in computer graphics and imaging, where 1-1 correspondences between meshes are computed. In practice, surface maps are usually represented and stored as 3D coordinates each vertex is mapped to, which often requires lots of storage memory. This causes inconvenien…
Semi-supervised Learning Approach to Generate Neuroimaging Modalities with Adversarial Trainingcs.LG
Develops a semi-supervised learning method to generate missing neuroimaging modalities.
problem Lack of paired neuroimaging data for training and inference.
method Semi-Supervised Adversarial CycleGAN (SSA-CGAN) using adversarial and cycle losses.
result Improves reconstruction error and robustness to noise.
Painless Activation Steering automates post-training for LMs without manual intervention.
problem Manual post-training methods are time-consuming and labor-intensive.
method Painless Activation Steering (PAS) is a fully automated approach that requires no manual intervention.
result PAS reliably improves performance for behavior tasks but not for intelligence-oriented tasks.
AutoKE automates embedding physical knowledge into neural networks for complex engineering problems.
problem Complex physical equations in engineering problems.
method AutoKE framework using deep neural networks, equation parsing, automatic differentiation, adaptive weights, and NAS.
result Automatically embeds physical knowledge into neural networks for complex equations efficiently.
Energy and momentum conservation in the Euler-Poincaré formulation of local Vlasov-Maxwell-type systemsphysics.plasm-ph
Derives energy and momentum conservation laws for Vlasov-Maxwell systems using Euler-Poincaré formulation.
problem Challenges in deriving energy and momentum conservation laws for Vlasov-Maxwell systems due to mixed Eulerian and Lagrangian variables.
method Uses Euler-Poincaré formulation to derive conservation laws for Vlasov-Maxwell-type systems, focusing on symmetries generated by isometries and time translation.
result Derives energy and momentum conservation laws for a generic class of Vlasov-Maxwell-type systems, providing a new derivation in the spirit of the Euler-Poincaré machinery.
Improved model-based reinforcement learning for multi-agent Markov games.
problem Suboptimal sample complexity for model-based algorithms in multi-agent reinforcement learning.
method Optimistic Nash Value Iteration (Nash-VI) for two-player zero-sum Markov games.
result First model-based algorithm matching information-theoretic lower bound with improved sample complexity.