cupy VS pydantic

I did not expect anything interesting, but this is actually cool.

> A full implementation of the NumPy API. Not something "NumPy-like" — just literally the NumPy API, with the same functions and the same arguments.

I suppose it's like https://cupy.dev/

What was the difference in runtime performance, and did you try CuPy?

https://github.com/cupy/cupy :

> CuPy is a NumPy/SciPy-compatible array library for GPU-accelerated computing with Python. CuPy acts as a drop-in replacement to run existing NumPy/SciPy code on NVIDIA CUDA or AMD ROCm platforms.

Projects using CuPy:

It's more effort though. You will likely have to format your data in specific ways for the GPU to efficiently process it. I've done this kind of thing with PyTorch tensors, but there are also math-specific libraries like CuPy. If you only have millions, Numpy should be fine.

I'd also recommend checking out CuPy which aims to fully re-implement the Numpy api for CUDA GPUs, while taking advantage of Nvidia's specialized libraries like cuBLAS, cuRAND, cuSOLVER etc. The tradeoff being that it only works with Nvidia GPUs.

u/Spataner's answer is great. If you WANT GPU-enabled numpy functions, I would check out CuPy: https://cupy.dev/

Not sure how VS Code is relevant here as it's just you IDE, shouldn't have any influence on this. Now, seeing as you're using numpy (which has no gpu support), you could try and use something like CuPy in place of numpy. I'm not sure about the interoperability because I've never used this myself, but if you're lucky it could be as simple as just replacing all numpy calls with the same CuPy calls (or replacing all import numpy as np with import cupy as np ).

Cupy replicates the numpy and scipy APIs but runs on the GPU.

For that, you can use cupy[0], PyTorch[1] or Tensorflow[2]. They all mimic the numpy's API with the possibility to use your GPU.

[0] https://cupy.dev/

First, note the method prefix_allowed_tokens_fn. This method applies a Pydantic model to constrain/guide how the LLM generates tokens. Next, see how that constrain can be applied to txtai's LLM pipeline.

utype is a concise alternative of pydantic with simplified parameters and usages, supporting both sync/async functions and generators parsing, and capable of using native logic operators to define logical types like AND/OR/NOT, also provides custom type parsing by register mechanism that supports libraries like pydantic, attrs and dataclasses

I like some of the changes from v1 to v2. But then you have something like this [0] removed from the library without proper documentation or replacement, resulting in ugly workarounds in the link that wont' work properly.

[0]: https://github.com/pydantic/pydantic/discussions/6337

The easiest implementation I found was to use a PyDantic class for my target schema — and use that as a parameter for the method call to “ChatCompletion.create()”. Here’s a fragment of the GinAI Python classes used.

Also, FastStream uses Pydantic to parse input JSON-encoded data into Python objects, making it easy to work with structured data in your applications, so you can serialize your input messages just using type annotations.

Pydantic Validation: Leverage Pydantic's validation capabilities to serialize and validate incoming messages

Not sure if it is exactly related, but there is an open issue on Github for that exact message.

Well the performance increase is so huge because pydantic1 is really really slow. And for using rust, I'd have expected more tbh…

I've been benchmarking pydantic v2 against typedload (which I write) and despite the rust, it still manages to be slower than pure python in some benchmarks.

The ones on the website are still about comparing to v1 because v2 was not out yet at the time of the last release.

pydantic's author will refuse to benchmark any library that is faster (https://github.com/pydantic/pydantic/pull/3264 https://github.com/pydantic/pydantic/pull/1525 https://github.com/pydantic/pydantic/pull/1810) and keep boasting about amazing performances.

On pypy, v2 beta was really really really slow.