The study evaluates three methods for real-time anomaly detection in CNC turning processes.
problem Real-time monitoring of tool wear in CNC turning processes.
method Evaluation of three conventional anomaly detection methods.
result The developed real-time anomaly detection algorithm was robust and accurate.
Characterizes surfaces enveloped by rotating cones for CNC machining.
problem Characterizing surfaces enveloped by rotating cones for CNC machining.
method Derives higher-order nonlinear PDEs for enveloping surfaces, including local approximations.
result Characterizations generalize previous work on developable and ruled surfaces.
New method uses deep learning to solve inverse problems with provable guarantees.
problem Solving inverse problems with high-quality results and provable guarantees.
method Convex-Nonconvex (CNC) framework with input weakly convex neural network (IWCNN).
result The method provides provably convergent regularization for inverse problems.
A new method helps escape saddle points in non-convex optimization.
problem Escaping saddle points in non-convex optimization problems.
method CNC-SCSG method using a separate SGD step to help escape from strict saddle points.
result The method converges to a second-order stationary point with a rate of O(ε−2log(1/ε)). In manufacture, steel and other metals are mainly cut and shaped during the fabrication process by computer numerical control (CNC) machines. To keep high productivity and efficiency of the fabrication process, engineers need to monitor the real-time process of CNC machines, and the lifetime management of machine tools…
Method improves few-shot one-class classification.
problem Learning binary classifier with data from only one class.
method Modified MAML algorithm to learn initialization for few-shot OCC.
result Method leads to better results than classical approaches.
Approximating complex curves with simple parametric curves is widely used in CAGD, CG, and CNC. This paper presents an algorithm to compute a certified approximation to a given parametric space curve with cubic B-spline curves. By certified, we mean that the approximation can approximate the given curve to any given pr…
Smooth curves from polygonal chains with vertex preservation and explicit curvature control.
problem Preserving vertices while smoothing polygonal chains to C∞ curves. method Directional mollification operator for polygonal chains.
result Smooth curves that intersect original vertices and maintain explicit curvature bounds.
The paper defines and explores vector bundles that can be turned and their properties.
problem Understanding which vector bundles can be turned and their properties.
method Defining and investigating vector bundles that can be turned, and developing their theory and obstructions.
result Rank-2k bundles over the 2k-sphere are turnable, and this implies orientability. Agrachev's problem on circle turns is solved for various topologies.
problem How many times must a circle be turned to allow deformation with non-degenerate Frenet frame?
method Introduced decorated turn data to retain a nontrivial turn-counting problem. Analyzed different topologies and dimensions.
result For Cn curve topology, k(2)=1, k(3)=2, and k(n)=1 for n≥4. Spherical Fenchel obstruction in all dimensions n≥4. Enhances math problem-solving models with multi-turn preference learning.
problem Improving mathematical problem-solving capabilities of large language models.
method Introduces a multi-turn direct preference learning framework for tool-integrated mathematical reasoning tasks.
result Significant performance improvements in model accuracy on math datasets.
Unified pipeline detects multi-turn deception using geometric signals.
problem Detecting multi-turn deceptive interactions in LLMs.
method Geometric signaturization via genetic prompt optimization.
result Compact geometric model achieves high recall and F1 scores.
ReOPD uses pre-collected teacher trajectories to distill knowledge from multi-turn interactions.
problem The cost of fully online on-policy distillation for multi-turn interactions.
method ReOPD, an off-environment alternative that reuses pre-collected teacher trajectories as replayed prefixes, addressing the prefix trap and distribution shift.
result ReOPD preserves or improves OPD-level accuracy, uses zero tool calls, and is at least 4imes faster per training step. Gold prices show seasonal behavior, with January and July having opposite returns.
problem Seasonal behavior in gold prices during the turn of the year.
method Statistical analysis and decomposition techniques.
result Gold prices exhibit strong cyclical behavior during the turn-of-the-year period, with January showing the highest return and July showing significant negative returns.
In (Yang et al. 2016), a hierarchical attention network (HAN) is created for document classification. The attention layer can be used to visualize text influential in classifying the document, thereby explaining the model's prediction. We successfully applied HAN to a sequential analysis task in the form of real-time m…
U-turn chains improve sampling from complex distributions.
problem Sampling from high-dimensional learned distributions.
method Iterative forward-backward diffusion steps with Metropolis-Hastings correction.
result Minimal U-turn dynamics exhibit phase transitions and layer-ordering inversion.
This study compares hierarchical and non-hierarchical models for open-domain multi-turn dialog generation.
problem Which kind of models (hierarchical or non-hierarchical) is better for open-domain multi-turn dialog generation?
method Systematically compared nearly all representative hierarchical and non-hierarchical models over the same experimental settings.
result Nearly all hierarchical models are worse than non-hierarchical models in open-domain multi-turn dialog generation, except for HRAN.
Enhances persona-based conversation model for multi-turn dialogue.
problem Improving persona-based conversation models for multi-turn dialogue.
method Introduced additional input modality into hredGAN to capture external attributes.
result Persona hredGAN (phredGAN) outperforms existing models in multi-turn dialogue corpora. In this paper we develop a complete theory of factorization for isometries of hyperbolic 4-space. Of special interest is the case where a pair of isometries is linked, that is, when a pair of isometries can be expressed each as compositions of two involutions, one of which is common to both isometries. Here we develop …
SeqAttnGAN generates interactive images based on multi-turn text descriptions.
problem Interactive image editing with multi-turn textual commands.
method SeqAttnGAN uses a neural state tracker and GAN framework for sequential image generation and refinement.
result SeqAttnGAN outperforms state-of-the-art models on interactive image editing tasks.
Proves minimax sample complexity for turn-based stochastic games.
problem Proving theoretical guarantees for reinforcement learning in turn-based stochastic games.
method Developing absorbing TBSG and reward perturbation techniques to handle statistical dependence.
result Empirical Nash equilibrium strategy approximates true Nash equilibrium in turn-based stochastic games.
New study on No-U-Turn Sampler for accelerated mixing in Hamiltonian Monte Carlo.
problem Achieving accelerated convergence in Hamiltonian Monte Carlo.
method Combining concentration of measure and coupling analysis for mixing.
result Rigorous mixing guarantees for the No-U-Turn Sampler in certain Gaussian distributions.
Modeling and learning turn-taking behaviors in multi-agent systems.
problem Modeling and predicting turn-taking behaviors in dynamic multi-agent systems.
method Individual behavior models (WFSTs) and multi-agent fusion model (logistic regression classifier).
result Accurately models and predicts turn-taking behaviors with high precision.
As automotive electronics continue to advance, cars are becoming more and more reliant on sensors to perform everyday driving operations. These sensors are omnipresent and help the car navigate, reduce accidents, and provide comfortable rides. However, they can also be used to learn about the drivers themselves. In thi…
Automated dialogue quality evaluation using user satisfaction estimates across multiple domains.
problem Lack of automated and domain-independent dialogue quality evaluation metrics.
method Created a new Response Quality annotation scheme, introduced five domain-independent feature sets, and experimented with six machine learning models.
result Gradient Boosting Regression model achieved best prediction performance, with a 16% relative improvement in binary satisfaction class prediction accuracy.
Causal Set Theory's Hauptvermutung is resolved in two ways, one of which is true.
problem Formulating and resolving the Hauptvermutung in Causal Set Theory.
method Two mathematically well-defined formulations of the Hauptvermutung, one of which is true.
result The Hauptvermutung is true when finite sets are replaced by countable sets.
A new clustering algorithm fuses heat diffusion and turning angle for robustness.
problem Cluster similar elements in various fields.
method Combines heat diffusion and maximal turning angle for robust fission clustering.
result The SARFC algorithm outperforms other methods in clustering performance.
Batch normalization with regularization turns deterministic autoencoders into generative models.
problem Creating generative models from deterministic autoencoders.
method Using batch normalization as a source of non-determinism and adding entropic regularization.
result Deterministic autoencoders can be transformed into generative models with similar performance to variational autoencoders.
New metric estimates user satisfaction for dialogue quality evaluation.
problem Sparse and intrusive explicit user feedback for dialogue quality evaluation.
method Created a new Response Quality annotation scheme and developed a turn-level User Satisfaction metric using five domain-independent feature sets and six machine learning models.
result Gradient boosting regression achieved best correlation of ~0.79 between predicted and annotated user satisfaction labels.
TristouNet is a neural network architecture based on Long Short-Term Memory recurrent networks, meant to project speech sequences into a fixed-dimensional euclidean space. Thanks to the triplet loss paradigm used for training, the resulting sequence embeddings can be compared directly with the euclidean distance, for s…
Study of financial time series and Brownian motion using order patterns and permutation entropy.
problem Analyzing order patterns and variation in financial time series and Brownian motion.
method Use of order patterns and permutation entropy to study financial data and Brownian motion, focusing on turning rate and up-down balance.
result For small lags, pattern frequencies in financial data remain constant. Up-down balance is better for change points in financial data.
We propose a reduction for non-convex optimization that can (1) turn an stationary-point finding algorithm into an local-minimum finding one, and (2) replace the Hessian-vector product computations with only gradient computations. It works both in the stochastic and the deterministic settings, without hurting the algor…
This paper has been withdrawn because the result turns out to be trivial.
NUTS mixing time scales as d^(1/4) for Gaussian distributions.
problem Improving the efficiency of the No-U-Turn Sampler (NUTS) for Gaussian distributions.
method Coupling argument leveraging geometric structure of Gaussian concentration, uniformity analysis of NUTS transitions.
result The mixing time of NUTS scales as d^(1/4) for Gaussian distributions, up to logarithmic factors.
The paper proves properties of branched covers of specific knots and tori.
problem Investigating the smoothness and diffeomorphism of specific 4-manifolds.
method Analyzing double branched covers of twist-roll spun knots and turned twisted tori, applying techniques to show diffeomorphism.
result Proves that certain 4-manifolds are diffeomorphic to standard manifolds.
Meena is a chatbot trained on social media data, achieving human-like conversation quality.
problem Creating a chatbot that can have human-like conversations in an open-domain setting.
method End-to-end training of a 2.6B parameter neural network on social media data, using perplexity and a human evaluation metric (SSA) to assess quality.
result Meena achieves a high human-like conversation quality (79% SSA) when compared to existing chatbots.
WALNUTS improves sampling efficiency and robustness for multi-scale distributions.
problem Adapting leapfrog step size for multi-scale posterior distributions.
method Adapts leapfrog step size at fixed intervals of simulated time, selecting the largest step size to keep energy error below a threshold.
result Substantial improvements in sampling efficiency and robustness compared to standard NUTS.
We introduce a geometric framework to study Newton's equations on infinite-dimensional configuration spaces of diffeomorphisms and smooth probability densities. It turns out that several important PDEs of hydrodynamical origin can be described in this framework in a natural way. In particular, the Madelung transform be…
Foundation models struggle with multi-turn exploration but can learn through regular summaries.
problem Foundation models struggle with multi-turn exploration in dynamic environments.
method Implemented a text-based version of the Alchemy environment to test multi-trial learning. Prompting models to summarize their observations at regular intervals enabled them to improve across trials and adapt to changes.
result Foundation models can improve through regular summaries, enabling multi-trial learning and adaptation.
We consider a surface link in the 4-space which can be presented by a simple branched covering over the standard torus, which we call a torus-covering link. Torus-covering links include spun T2-knots and turned spun T2-knots. In this paper we braid a torus-covering link over the standard 2-sphere. This gives an u…
This note provides an alternate account of Calegari's rationality theorem for stable commutator length in free groups.
A RL approach finds Nash equilibrium for turn-based zero-sum games.
problem Finding Nash equilibrium in two-player turn-based zero-sum games.
method EIS method combining exploration, policy improvement, and supervised learning.
result EIS method finds an ε-approximate value function of Nash equilibrium in O(ε^(-(d+4))) steps.
Deep neural network detects driver intentions from video.
problem Detecting driver intentions for safer self-driving.
method Uses deep learning to analyze turn signals and emergency flashers.
result High per-frame accuracy in challenging scenarios.
Study examines how twisting graphene nanoribbons affects their thermal conductivity.
problem Understanding how twisting affects thermal conductivity in graphene nanoribbons.
method Calculated geometric parameters of TGNRs, including twist and writhe, and used molecular dynamics simulations.
result Twisted graphene nanoribbons require at least two parameters to accurately describe their thermal conductivity.
We study simple wrinkled fibrations, a variation of the simplified purely wrinkled fibrations introduced by Williams, and their combinatorial description in terms of surface diagrams. We show that simple wrinkled fibrations induce handle decompositions on their total spaces which are very similar to those obtained from…
This paper analyzes the convergence of dynamic HMC and NUTS methods.
problem Theoretical understanding of dynamic HMC and NUTS convergence.
method General class of MCMC algorithms, NUTS as a particular case, geometric ergodicity, irreducibility.
result NUTS is geometrically ergodic under certain conditions and ergodic without bounded stepsize.
In this note we use Blanchfield forms to study knots that can be turned into an unknot using a single t2k move.
Study toric gravitational instantons using rod structures and inequalities.
problem Classify toric ALE/ALF instantons.
method Express signature in terms of rod structure, apply Hitchin-Thorpe inequalities, analyze rod structures with three turning points.
result Necessary conditions for rod structures of toric ALE/ALF instantons.